|
| |
|
|
A055844
|
|
A second order recursive sequence.
|
|
1
| |
|
|
1, 14, 95, 440, 1595, 4862, 13013, 31460, 70070, 145860, 286858, 537472, 965770, 1673140, 2806870, 4576264, 7272991, 11296450, 17185025, 25654200, 37642605, 54367170, 77388675, 108689100, 150762300, 206719656, 280412484, 376573120
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
REFERENCES
| A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.
|
|
|
FORMULA
| a(n)=(5n+9)*C(n+8, 8)/9.
|
|
|
EXAMPLE
| G.f.(x)=(1+4x)/(1-x)^10.
|
|
|
CROSSREFS
| Cf. A052255.
Cf. A093562 ((5, 1) Pascal, column m=9).
Sequence in context: A101383 A044265 A044646 * A008534 A008415 A003206
Adjacent sequences: A055841 A055842 A055843 * A055845 A055846 A055847
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Barry E. Williams, May 30 2000
|
| |
|
|
