|
| |
| |
|
|
|
1, 10, 56, 231, 782, 2300, 6085, 14820, 33775, 72905, 150438, 298925, 575333, 1077748, 1972851, 3540913, 6249235, 10871723, 18683233, 31775031, 53566369, 89633545, 149052839, 246575109, 406146248, 666605513, 1090907965
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
REFERENCES
| A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.
|
|
|
FORMULA
| a(n)=sum{C(n+9-i, n-2i; i=0 to [n/2]}; n >= 0; [x]=greatest integer in x.
a(n)=Sum_{k=1..n}{C(n-k+9,k+8)}, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Apr 16 2008
G.f.:1/((x^2+x-1)*(x-1)^9) [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009]
|
|
|
EXAMPLE
| a(n)=a(n-1)+a(n-2)+C(n+8,8); n >= 0; a(-1)=0.
|
|
|
MATHEMATICA
| lst={}; s0=s1=s2=s3=s4=s5=s6=s7=s8=0; Do[s0+=a[n]; s1+=s0; s2+=s1; s3+=s2; s4+=s3; s5+=s4; s6+=s5; s7+=s6; s8+=s7; AppendTo[lst, s8], {n, 0, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 10 2008]
|
|
|
CROSSREFS
| Cf. A053296, A053295, A000045.
Sequence in context: A053493 A198833 A001786 * A035040 A002889 A055911
Adjacent sequences: A053306 A053307 A053308 * A053310 A053311 A053312
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Barry E. Williams, Mar 06 2000
|
| |
|
|
