login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A117591 2^n + Fibonacci(n). 4
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; 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

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.

Sequence in context: A158943 A133999 A014610 * A003055 A018101 A158568

Adjacent sequences:  A117588 A117589 A117590 * A117592 A117593 A117594

KEYWORD

easy,nonn

AUTHOR

Frank Adams-Watters (FrankTAW(AT)Netscape.net), Apr 04 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 18:50 EST 2012. Contains 205841 sequences.