|
Search: id:A038725
|
|
|
| A038725 |
|
a(n)=6a(n-1)-a(n-2), n >= 2, a(0)=1, a(1)=2. |
|
+0
4
|
|
| 1, 2, 11, 64, 373, 2174, 12671, 73852, 430441, 2508794, 14622323, 85225144, 496728541, 2895146102, 16874148071, 98349742324, 573224305873, 3340996092914, 19472752251611, 113495517416752, 661500352248901
(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.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n) = 7*a(n-1) - 7*a(n-2) + a(n-3); a(n) = ((4-sqrt(2))/8)*(3+2*sqrt(2))^(n-1)+((4+sqrt(2))/8)*(3-2*sqrt(2))^(n-1). - Antonio A. Olivares (olivares14031(AT)yahoo.com), Mar 29 2008
|
|
MAPLE
|
a[0]:=1: a[1]:=2: for n from 2 to 26 do a[n]:=6*a[n-1]-a[n-2] od: seq(a[n], n=0..20); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 26 2006
|
|
CROSSREFS
|
Cf. A001653 and A001541.
Adjacent sequences: A038722 A038723 A038724 this_sequence A038726 A038727 A038728
Sequence in context: A114175 A080049 A126745 this_sequence A001565 A074613 A039632
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, May 02 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 03 2000
|
|
|
Search completed in 0.002 seconds
|
