|
Search: id:A055268
|
|
|
| A055268 |
|
A second order recursive sequence. |
|
+0
3
|
|
| 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; 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)=(11n+4)*C(n+3, 3)/4.
|
|
CROSSREFS
|
Cf. A000292 and A050441.
Sequence in context: A005917 A027455 A152729 this_sequence A090026 A027526 A033653
Adjacent sequences: A055265 A055266 A055267 this_sequence A055269 A055270 A055271
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, May 10 2000
|
|
|
Search completed in 0.002 seconds
|
