|
Search: id:A054486
|
|
|
| A054486 |
|
A second order recursive sequence. |
|
+0
7
|
|
| 1, 5, 14, 37, 97, 254, 665, 1741, 4558, 11933, 31241, 81790, 214129, 560597, 1467662, 3842389, 10059505, 26336126, 68948873, 180510493, 472582606, 1237237325, 3239129369, 8480150782, 22201322977, 58123818149, 152170131470
(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
|
Index entries for sequences related to linear recurrences with constant coefficients
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n)=3a(n-1)-a(n-2), a(0)=1, a(1)=5.
a054486(n) + 7*A001519(n) = A005248(n) - Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Oct 30 2004
Lucas(2n+1) + Fibonacci(2n).
G.f.: (1+2*x)/(1-3*x+x^2). [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 03 2008]
|
|
EXAMPLE
|
a(n)={5*([(3+sqrt(5))/2]^n-[(3-sqrt(5))/2]^n)-([(3+sqrt(5))/2]^(n-1)-[(3-sqrt(5))/2]^(n-1))}/sqrt(5).
|
|
CROSSREFS
|
Cf. A002878.
Sequence in context: A052951 A048745 A127980 this_sequence A072130 A045553 A111715
Adjacent sequences: A054483 A054484 A054485 this_sequence A054487 A054488 A054489
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, May 06 2000
|
|
EXTENSIONS
|
"a(1)=5", not "a(0)=5" Dan Nielsen (nielsed(AT)uah.edu), Sep 10 2009
|
|
|
Search completed in 0.005 seconds
|
