|
Search: id:A013655
|
|
|
| A013655 |
|
F(n)+L(n), where F(n) and L(n) are Fibonacci and Lucas numbers respectively. |
|
+0
8
|
|
| 3, 2, 5, 7, 12, 19, 31, 50, 81, 131, 212, 343, 555, 898, 1453, 2351, 3804, 6155, 9959, 16114, 26073, 42187, 68260, 110447, 178707, 289154, 467861, 757015, 1224876, 1981891, 3206767, 5188658, 8395425, 13584083, 21979508, 35563591, 57543099
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
FORMULA
|
a(n)=a(n-1)+a(n-2).
For n > 1, a(n) = F(n+3) - F(n-2) (Fibonacci numbers, A000045) - Gerald McGarvey (Gerald.McGarvey(AT)comcast.net), Jul 10 2004
a(n)=2*fibonacci(n-3)+fibonacci(n), n>=2 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
|
|
MAPLE
|
with(combinat):a:=n->2*fibonacci(n-3)+fibonacci(n): seq(a(n), n=2..38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 05 2007
|
|
CROSSREFS
|
Apart from initial term, same as A001060.
Sequence in context: A118320 A082334 A110338 this_sequence A094894 A089334 A016649
Adjacent sequences: A013652 A013653 A013654 this_sequence A013656 A013657 A013658
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Mohammad K. Azarian (ma3(AT)evansville.edu)
|
|
EXTENSIONS
|
More terms from Erich Friedman (erich.friedman(AT)stetson.edu).
|
|
|
Search completed in 0.002 seconds
|
