|
|
A128533
|
|
a(n) = F(n)*L(n+2) where F=Fibonacci and L=Lucas numbers.
|
|
5
|
|
|
0, 4, 7, 22, 54, 145, 376, 988, 2583, 6766, 17710, 46369, 121392, 317812, 832039, 2178310, 5702886, 14930353, 39088168, 102334156, 267914295, 701408734, 1836311902, 4807526977, 12586269024, 32951280100, 86267571271, 225851433718, 591286729878
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Generally, F(n)*L(n+k) = F(2*n + k) + F(k)*(-1)^(n+1): if k = 0 then sequence is A001906, if k = 1 it is A081714.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = F(2*(n+1)) + (-1)^(n+1), assuming F(0) = 0 and L(0) = 2.
a(n) = 2*a(n-1) + 2*a(n-2) - a(n-3).
G.f.: x*(4-x)/((1+x)*(x^2-3*x+1)). (End)
0 = a(n)*(+4*a(n) + a(n+1) - 17*a(n+2)) + a(n+1)*(-14*a(n+1) + a(n+2)) + a(n+2)*(+4*a(n+2)) for all n in Z. - Michael Somos, May 26 2014
|
|
EXAMPLE
|
a(4) = 54 because F(4)*L(6) = 3*18.
G.f. = 4*x + 7*x^2 + 22*x^3 + 54*x^4 + 145*x^5 + 376*x^6 + 988*x^7 + ...
|
|
MAPLE
|
|
|
MATHEMATICA
|
a[n_]:= Fibonacci[2n+2] -(-1)^n; (* Michael Somos, May 26 2014 *)
|
|
PROG
|
(PARI) vector(30, n, n--; fibonacci(2*(n+1)) + (-1)^(n+1)) \\ G. C. Greubel, Jan 07 2019
(Sage) [fibonacci(2*(n+1)) + (-1)^(n+1) for n in (0..30)] # G. C. Greubel, Jan 07 2019
(GAP) List([0..30], n -> Fibonacci(2*(n+1)) + (-1)^(n+1)); # G. C. Greubel, Jan 07 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|