|
Search: id:A038723
|
|
|
| A038723 |
|
a(n)=6a(n-1)-a(n-2), n >= 2, a(0)=1, a(1)=4. |
|
+0
5
|
|
| 1, 4, 23, 134, 781, 4552, 26531, 154634, 901273, 5253004, 30616751, 178447502, 1040068261, 6061962064, 35331704123, 205928262674, 1200237871921, 6995498968852, 40772755941191, 237641036678294, 1385073464128573
(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
a(n) = A001653(n) - A001653(n - 1) - ... - A001653(n - (n - 1)) - Antonio A. Olivares (olivares14031(AT)yahoo.com), Mar 29 2008
|
|
MAPLE
|
a[0]:=1: a[1]:=4: 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, A001541, A038725.
Cf. A001653.
Adjacent sequences: A038720 A038721 A038722 this_sequence A038724 A038725 A038726
Sequence in context: A124507 A015532 A024050 this_sequence A091640 A067110 A038736
|
|
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
|
