OFFSET
0,2
REFERENCES
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (10,-44,111,-174,168,-84,-6,39,-26,8,-1).
FORMULA
a(n) = Sum_{i=0..floor(n/2)} C(n+9-i, n-2i), n >= 0.
a(n) = a(n-1) + a(n-2) + C(n+8,8); n >= 0; a(-1)=0.
G.f.: 1/((x^2 + x - 1)*(x-1)^9). - Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009
MATHEMATICA
Table[Sum[Binomial[n+9-j, n-2j], {j, 0, Floor[n/2]}], {n, 0, 50}] (* G. C. Greubel, May 24 2018 *)
PROG
(PARI) for(n=0, 30, print1(sum(j=0, floor(n/2), binomial(n+9-j, n-2*j)), ", ")) \\ G. C. Greubel, May 24 2018
(Magma) [(&+[Binomial(n+9-j, n-2*j): j in [0..Floor(n/2)]]): n in [0..30]]; // G. C. Greubel, May 24 2018
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Barry E. Williams, Mar 06 2000
STATUS
approved