|
Search: id:A056003
|
|
|
| A056003 |
|
A second order recursive sequence. |
|
+0
4
|
|
| 1, 18, 135, 660, 2475, 7722, 21021, 51480, 115830, 243100, 481338, 906984, 1637610, 2848860, 4796550, 7845024, 12503007, 19468350, 29683225, 44401500, 65270205, 94427190, 134617275, 189329400, 262957500, 360988056, 490217508
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.
|
|
FORMULA
|
a(n)=(n+1)*C(n+8, 8). G.f.(x)=(1+8x)/(1-x)^10.
|
|
MAPLE
|
a:=n->(sum((numbcomp(n, 9)), j=9..n)):seq(a(n), n=9..35); [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Aug 26 2008]
|
|
CROSSREFS
|
Cf. A052206.
Cf. A093644 ((9, 1) Pascal, column m=9). Partial sums of A056117.
Sequence in context: A103308 A010824 A022710 this_sequence A114239 A087115 A163707
Adjacent sequences: A056000 A056001 A056002 this_sequence A056004 A056005 A056006
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Jun 12 2000
|
|
|
Search completed in 0.002 seconds
|
