|
| |
|
|
A055268
|
|
(11n+4)*C(n+3, 3)/4.
|
|
2
| |
|
|
1, 15, 65, 185, 420, 826, 1470, 2430, 3795, 5665, 8151, 11375, 15470, 20580, 26860, 34476, 43605, 54435, 67165, 82005, 99176, 118910, 141450, 167050, 195975, 228501, 264915, 305515, 350610, 400520, 455576, 516120, 582505, 655095, 734265
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| a(n) is the number of compositions of n when there are 9 types of each natural number. [From Milan R. Janjic (agnus(AT)blic.net), Aug 13 2010]
|
|
|
REFERENCES
| I. Adler, Three Diophantine equations - Part II, Fib. Quart., 7 (1969), pps. 181-193.
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 122-125, 194-196.
E. I. Emerson, Recurrent Sequences in the Equation DQ^2=R^2+N, Fib. Quart.,7 (1969), pps. 231-242.
|
|
|
LINKS
| Index to sequences with linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
|
|
|
FORMULA
| G.f. ( -1-10*x ) / (x-1)^5 . - R. J. Mathar, Oct 26 2011
|
|
|
CROSSREFS
| Cf. A000292 and A050441.
Sequence in context: A005917 A027455 A152729 * A090026 A027526 A033653
Adjacent sequences: A055265 A055266 A055267 * A055269 A055270 A055271
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Barry E. Williams, May 10 2000
|
| |
|
|
