A374259 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A374259

a(n) = 2*a(n-1) + 2*a(n-2) - a(n-3), with a(0)=4, a(1)=6, a(2)=20.

4, 6, 20, 48, 130, 336, 884, 2310, 6052, 15840, 41474, 108576, 284260, 744198, 1948340, 5100816, 13354114, 34961520, 91530452, 239629830, 627359044, 1642447296, 4299982850, 11257501248, 29472520900, 77160061446, 202007663444, 528862928880, 1384581123202, 3624880440720, 9490060198964

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,1

COMMENTS

a(n) is the number of edge covers of a rocket graph R_{3,n,n}.

A rocket graph R_{3,n,n} is cycle graph C_3 with two paths of n edges, where an end vertex of each path is identified with a distinct vertex in the C_3.

In other words, a rocket graph is a path with vertices -n-1, ..., -1, 0, 1, ..., n+1 with an additional edge (-1,1).

LINKS

Paolo Xausa, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (2,2,-1).

FORMULA

G.f.: (4-2*x)/(1-2*x-2*x^2+x^3).

a(n) = 2*A059929(n+1).

a(n) = Fibonacci(2n+2)+3*Fibonacci(n+1)*Fibonacci(n+1).

EXAMPLE

For n=1, the R_{3,1,1} rocket graph is as follows and has a(1)=6 edge covers.

*--*

* |