Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117591 2^n + Fibonacci(n). +0
3
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; listen)
OFFSET

0,2

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.

Sequence in context: A084321 A133999 A014610 this_sequence A003055 A018101 A068013

Adjacent sequences: A117588 A117589 A117590 this_sequence A117592 A117593 A117594

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research