OFFSET
0,2
REFERENCES
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Hung Viet Chu, Partial Sums of the Fibonacci Sequence, arXiv:2106.03659 [math.CO], 2021.
Index entries for linear recurrences with constant coefficients, signature (6,-14,15,-5,-4,4,-1).
FORMULA
a(n) = Sum_{i=0..floor(n/2)} binomial(n+5-i, n-2*i) for n >= 0.
a(n) = a(n-1) + a(n-2) + C(n+4,4); n >= 0; a(-1)=0.
G.f.: 1/((1-x-x^2)*(1-x)^5). - R. J. Mathar, May 22 2013
a(n) = Fibonacci(n+11) - (n^4 + 22*n^3 + 203*n^2 + 974*n + 2112)/4!. - G. C. Greubel, Sep 06 2019
MAPLE
with(combinat); seq(fibonacci(n+11)-(n^4 + 22*n^3 + 203*n^2 + 974*n + 2112)/4!, n = 0..35); # G. C. Greubel, Sep 06 2019
MATHEMATICA
Table[Fibonacci[n+11] -(n^4+22*n^3+203*n^2+974*n+2112)/4!, {n, 0, 35}] (* G. C. Greubel, Sep 06 2019 *)
PROG
(PARI) vector(35, n, m=n-1; fibonacci(n+10) - (m^4+22*m^3+203*m^2+974*m +2112)/4!) \\ G. C. Greubel, Sep 06 2019
(Magma) [Fibonacci(n+11) - (n^4+22*n^3+203*n^2+974*n+2112)/24: n in [0..35]]; // G. C. Greubel, Sep 06 2019
(Sage) [fibonacci(n+11) - (n^4+22*n^3+203*n^2+974*n+2112)/24 for n in (0..35)] # G. C. Greubel, Sep 06 2019
(GAP) List([0..35], n-> Fibonacci(n+11)-(n^4+22*n^3+203*n^2+974*n + 2112)/24); # G. C. Greubel, Sep 06 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Barry E. Williams, Feb 13 2000
EXTENSIONS
Terms a(28) onward added by G. C. Greubel, Sep 06 2019
STATUS
approved