|
Search: id:A054487
|
|
|
| A054487 |
|
A second order recursive sequence. |
|
+0
3
|
|
| 1, 14, 90, 390, 1320, 3762, 9438, 21450, 45045, 88660, 165308, 294372, 503880, 833340, 1337220, 2089164, 3187041, 4758930, 6970150, 10031450, 14208480, 19832670, 27313650, 37153350, 49961925, 66475656, 87576984, 114316840
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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.
|
|
FORMULA
|
a(n)=(3n+4)*C(n+7, 7)/4.
G.f.: (1+5*x)/(1-x)^9.
|
|
CROSSREFS
|
Cf. A034265.
Cf. A093563 ((6, 1) Pascal, column m=8).
Sequence in context: A034544 A077538 A114242 this_sequence A047639 A010930 A022609
Adjacent sequences: A054484 A054485 A054486 this_sequence A054488 A054489 A054490
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, May 06 2000
|
|
EXTENSIONS
|
Corrected and extended by James A. Sellers (sellersj(AT)math.psu.edu), May 10 2000
|
|
|
Search completed in 0.002 seconds
|
