|
Search: id:A056114
|
|
|
| A056114 |
|
A second order recursive sequence. |
|
+0
1
|
|
| 1, 20, 165, 880, 3575, 12012, 35035, 91520, 218790, 486200, 1016158, 2015520, 3821090, 6963880, 12257850, 20920064, 34730575, 56241900, 89049675, 138138000, 210315105, 314757300, 463681725, 673171200, 964177500
(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+9, 9).
|
|
EXAMPLE
|
G.f.(x)=(1+9x)/(1-x)^11.
|
|
CROSSREFS
|
Cf. A056003.
Sequence in context: A118676 A067534 A041768 this_sequence A056932 A010826 A022712
Adjacent sequences: A056111 A056112 A056113 this_sequence A056115 A056116 A056117
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Jun 12 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 20 2000
|
|
|
Search completed in 0.002 seconds
|
