|
|
A022088
|
|
Fibonacci sequence beginning 0, 5.
|
|
16
|
|
|
0, 5, 5, 10, 15, 25, 40, 65, 105, 170, 275, 445, 720, 1165, 1885, 3050, 4935, 7985, 12920, 20905, 33825, 54730, 88555, 143285, 231840, 375125, 606965, 982090, 1589055, 2571145, 4160200, 6731345, 10891545, 17622890, 28514435, 46137325, 74651760, 120789085
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
REFERENCES
|
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, pp. 15, 34, 52.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 5*Fibonacci(n).
The o.g.f. for the shifted series b(0)=0 and b(n) = a(n+1) is G(x) = 5*x*(1+x)/(1-x*(1+x)) = 5 L(-Cinv(-x)), where L(x) = x/(1-x) with inverse Linv(x) = x/(1+x) and Cinv(x) = x*(1-x), the inverse of the o.g.f. for the shifted Catalan numbers of A000108, C(x) = (1-sqrt(1-4*x))/2. Then Ginv(x) = -C(-Linv(x/5)) = (-1 + sqrt(1+4*x/(5+x)))/2.
a(n+1) = 5*Sum_{k=0..n} binomial(n-k,k) = 5 * A000045(n+1), from A267633, with the convention for zeros of the binomial assumed there.
(End)
|
|
MATHEMATICA
|
LinearRecurrence[{1, 1}, {0, 5}, 40] (* Harvey P. Dale, Jan 13 2012 *)
|
|
PROG
|
(SageMath) [5*fibonacci(n) for n in range(51)] # G. C. Greubel, Feb 10 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|