|
|
A118658
|
|
a(n) = 2*F(n-1) = L(n) - F(n), where F(n) and L(n) are Fibonacci and Lucas numbers respectively.
|
|
13
|
|
|
2, 0, 2, 2, 4, 6, 10, 16, 26, 42, 68, 110, 178, 288, 466, 754, 1220, 1974, 3194, 5168, 8362, 13530, 21892, 35422, 57314, 92736, 150050, 242786, 392836, 635622, 1028458, 1664080, 2692538, 4356618, 7049156, 11405774, 18454930, 29860704, 48315634, 78176338
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Also the number of matchings in the (n-2)-pan graph. - Eric W. Weisstein, Jun 30 2016
Also the number of maximal independent vertex sets (and minimal vertex covers) in the (n-1)-ladder graph. - Eric W. Weisstein, Jun 30 2017
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Matching
Eric Weisstein's World of Mathematics, Pan Graph
|
|
FORMULA
|
a(0)=2, a(1)=0; for n > 1, a(n) = a(n-1) + a(n-2).
G.f. (2 - 2*x)/(1 - x - x^2).
a(0)=2 and a(n) = 2*A000045(n-1) for n > 0. (End)
a(n) = 3*Fibonacci(n-2) + Fibonacci(n-5). - Bruno Berselli, Feb 20 2017
E.g.f.: 2*exp(x/2)*(5*cosh(sqrt(5)*x/2) - sqrt(5)*sinh(sqrt(5)*x/2))/5. - Stefano Spezia, Apr 18 2022
|
|
MAPLE
|
with(combinat): seq(2*fibonacci(n-1), n=0..40); # Muniru A Asiru, Oct 07 2018
a := n -> -2*I^n*ChebyshevU(n-2, -I/2):
|
|
MATHEMATICA
|
Subtract @@@ (Through[{LucasL, Fibonacci}[#]] & /@ Range[0, 20]) (* Eric W. Weisstein, Jun 30 2017 *)
CoefficientList[Series[(2 (-1 + x))/(-1 + x + x^2), {x, 0, 20}], x] (* Eric W. Weisstein, Jun 30 2017 *)
|
|
PROG
|
(GAP) List([0..40], n->2*Fibonacci(n-1)); # Muniru A Asiru, Oct 07 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Bill Jones (b92057(AT)yahoo.com), May 18 2006
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|