|
Search: id:A054490
|
|
|
| A054490 |
|
A Pellian-related second order recursive sequence. |
|
+0
5
|
|
| 1, 11, 65, 379, 2209, 12875, 75041, 437371, 2549185, 14857739, 86597249, 504725755, 2941757281, 17145817931, 99933150305, 582453083899, 3394785353089, 19786259034635, 115322768854721, 672150354093691
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Additionally, (A054490)=sqrt{8*(A038723)^2-7}
|
|
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 entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n)=6a(n-1)-a(n-2), a(0)=1, a(1)=11.
a(n)={11*([3+2sqrt(2)]^n-[3-2sqrt(2)]^n)-([3+2sqrt(2)]^(n-1)-[3-2sqrt(2)]^(n-1))}/4sqrt(2).
G.f.: (1+5*x)/(1-6*x+x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 03 2008]
a(n)=third binomial transform of 1,8,8,64,64,512 [From Al Hakanson (hawkuu(AT)gmail.com), Aug 17 2009]
|
|
EXAMPLE
|
a(3)=379 [From Al Hakanson (hawkuu(AT)gmail.com), Aug 17 2009]
|
|
MAPLE
|
a[0]:=1: a[1]:=11: for n from 2 to 26 do a[n]:=6*a[n-1]-a[n-2] od: seq(a[n], n=0..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 26 2006
|
|
CROSSREFS
|
Cf. A054488, A054489, A038723.
Adjacent sequences: A054487 A054488 A054489 this_sequence A054491 A054492 A054493
Sequence in context: A054333 A036601 A125321 this_sequence A126479 A139611 A154617
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, May 04 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 05 2000
|
|
|
Search completed in 0.002 seconds
|
