|
Search: id:A054477
|
|
|
| A054477 |
|
A Pellian-related sequence. |
|
+0
2
|
|
| 1, 13, 64, 307, 1471, 7048, 33769, 161797, 775216, 3714283, 17796199, 85266712, 408537361, 1957420093, 9378563104, 44935395427, 215298414031, 1031556674728, 4942484959609, 23680868123317, 113461855656976
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. F. Horadam, Pell Identities, Fib. Quart., Vol. 9, No. 3, 1971, pps. 245-252.
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, p. 256.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n)=5a(n-1)-a(n-2); a(0)=1, a(1)=13.
(A054477)=sqrt{21*(A002320)^2-20}; where the algebraic operations on (A------) are performed from the inside - out; that is, first squared, then multiplied by 21, then 20 is subtracted, and finally the square root is performed term-by-term.
|
|
CROSSREFS
|
Cf. A002320.
Adjacent sequences: A054474 A054475 A054476 this_sequence A054478 A054479 A054480
Sequence in context: A051878 A092653 A067465 this_sequence A010820 A022705 A067160
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Apr 16 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Apr 16 2000
|
|
|
Search completed in 0.002 seconds
|
