|
Search: id:A036605
|
|
|
| A036605 |
|
a(n)=a(n-2)+2*a(n-3)+a(n-4). |
|
+0
2
|
|
| 1, 4, 4, 7, 13, 19, 31, 52, 82, 133, 217, 349, 565, 916, 1480, 2395, 3877, 6271, 10147, 16420, 26566, 42985, 69553, 112537, 182089, 294628, 476716, 771343, 1248061, 2019403, 3267463, 5286868, 8554330, 13841197, 22395529, 36236725
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
D. E. Knuth, Art of Computer Programming, Vol. 3, Sect. 5.4.2, Eq. (25).
|
|
FORMULA
|
3 * [Fibonacci(n+2)/2] + 1. - R. Stephan, Dec 02 2004
|
|
MAPLE
|
A036605 := proc(n) option remember; if n <= 0 then 1 else A036605(n-2)+2*A036605(n-3)+A036605(n-4); fi; end;
|
|
CROSSREFS
|
Cf. A004695.
Sequence in context: A063984 A011981 A109544 this_sequence A115292 A019159 A019250
Adjacent sequences: A036602 A036603 A036604 this_sequence A036606 A036607 A036608
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
