|
Search: id:A055850
|
|
|
| A055850 |
|
a(n)=3a(n-1)-a(n-2); a(0)=1, a(1)=10. |
|
+0
3
|
|
| 1, 10, 29, 77, 202, 529, 1385, 3626, 9493, 24853, 65066, 170345, 445969, 1167562, 3056717, 8002589, 20951050, 54850561, 143600633, 375951338, 984253381, 2576808805, 6746173034, 17661710297, 46238957857, 121055163274
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n)={10*[((3+sqrt(5))/2)^n-((3-sqrt(5))/2)^n]-[((3+sqrt(5))/2)^(n-1)-((3-sqrt(5))/2)^(n-1)]}/sqrt(5).
G.f.(x)=(1+7x)/(1-3x+x^2).
Lucas(2n+1) + 6*Fibonacci(2n).
|
|
CROSSREFS
|
Adjacent sequences: A055847 A055848 A055849 this_sequence A055851 A055852 A055853
Sequence in context: A079273 A048469 A048772 this_sequence A027979 A057456 A002422
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Jun 03 2000
|
|
|
Search completed in 0.002 seconds
|
