|
| |
|
|
A117591
|
|
2^n + Fibonacci(n).
|
|
5
|
|
|
|
1, 3, 5, 10, 19, 37, 72, 141, 277, 546, 1079, 2137, 4240, 8425, 16761, 33378, 66523, 132669, 264728, 528469, 1055341, 2108098, 4212015, 8417265, 16823584, 33629457, 67230257, 134414146, 268753267, 537385141, 1074573864, 2148829917
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
a(3n) is even if n>0. - Robert G. Wilson v, Sep 06 2002
3 divides a(8n+1) and a(8n-1) - Enrique Pérez Herrero, Dec 29 2010
|
|
|
LINKS
|
Table of n, a(n) for n=0..31.
|
|
|
FORMULA
|
G.f. (1-3x^2)/((1-x-x^2)*(1-2x)).
|
|
|
MATHEMATICA
|
Table[f=Fibonacci[n]; 2^n+f, {n, 1, 40, 1}] (Vladimir Orlovsky, Jul 23 2008)
|
|
|
CROSSREFS
|
Cf. A000045, A000079, A074824.
Cf. A001611, A212262.
Sequence in context: A158943 A133999 A014610 * A003055 A217925 A018101
Adjacent sequences: A117588 A117589 A117590 * A117592 A117593 A117594
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
Franklin T. Adams-Watters, Apr 04 2006
|
|
|
STATUS
|
approved
|
| |
|
|
