Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101353
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101353 Sum(2^k+Fibonacci(k),k=0..n). +0
1
1, 4, 9, 19, 38, 75, 147, 288, 565, 1111, 2190, 4327, 8567, 16992, 33753, 67131, 133654, 266323, 531051, 1059520, 2114861, 4222959, 8434974, 16852239, 33675823, 67305280, 134535537, 268949683, 537702950, 1075088091, 2149661955 (list; graph; listen)
OFFSET

0,2

FORMULA

Fib(n+2) + 2^(n+1) + 2. - Ralf Stephan, May 16 2007

MAPLE

seq(sum(2^x+fibonacci(x), x=0..a), a=0..30);

CROSSREFS

Sequence in context: A023611 A002804 A133649 this_sequence A008135 A009885 A052549

Adjacent sequences: A101350 A101351 A101352 this_sequence A101354 A101355 A101356

KEYWORD

nonn

AUTHOR

Jorge Coveiro (jorgecoveiro(AT)yahoo.com), Dec 25 2004

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 30 22:12 EST 2008. Contains 150989 sequences.


AT&T Labs Research