|
|
A055267
|
|
a(n) = 3*a(n-1) - a(n-2) with a(0)=1, a(1)=7.
|
|
4
|
|
|
1, 7, 20, 53, 139, 364, 953, 2495, 6532, 17101, 44771, 117212, 306865, 803383, 2103284, 5506469, 14416123, 37741900, 98809577, 258686831, 677250916, 1773065917, 4641946835, 12152774588, 31816376929, 83296356199, 218072691668, 570921718805, 1494692464747
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 122-125, 194-196.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (7*(((3 + sqrt(5))/2)^n - ((3 - sqrt(5))/2)^n) - (((3 + sqrt(5))/2)^(n - 1) - ((3 - sqrt(5))/2)^(n - 1)))/sqrt(5).
G.f.: (1 + 4*x)/(1 - 3*x + x^2).
a(n) = 5*Fibonacci(2*n) + Fibonacci(2*n+1).
a(n) = 4*Fibonacci(2*n - 1) + 3*Lucas(2*n - 1). (End)
E.g.f.: exp(3*t/2)*( cosh(sqrt(5)*t/2) + (11/sqrt(5))*sinh(sqrt(5)*t/2) ). - G. C. Greubel, Jan 17 2020
|
|
MAPLE
|
with(combinat); seq(fibonacci(2*n+2) +4*fibonacci(2*n), n=0..30); # G. C. Greubel, Jan 17 2020
|
|
MATHEMATICA
|
Table[5*Fibonacci[2n] + Fibonacci[2n+1], {n, 0, 30}]
Table[4*Fibonacci[2n-1] + 3*LucasL[2n-1], {n, 0, 30}] (* Rigoberto Florez, Dec 24 2018 *)
|
|
PROG
|
(PARI) Vec((1+4*x)/(1-3*x+x^2) + O(x^40)) \\ Michel Marcus, Sep 06 2017
(Magma) [5*Fibonacci(2*n) + Fibonacci(2*n+1): n in [0..30]]; // Vincenzo Librandi, Dec 25 2018
(Sage) [fibonacci(2*n+2) +4*fibonacci(2*n) for n in (0..30)] # G. C. Greubel, Jan 17 2020
(GAP) List([0..30], n-> Fibonacci(2*n+2) +4*Fibonacci(2*n) ); # G. C. Greubel, Jan 17 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|