|
| |
|
|
A101353
|
|
Sum(2^k+Fibonacci(k),k=0..n).
|
|
0
| |
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
FORMULA
| Fib(n+2) + 2^(n+1) + 2. - Ralf Stephan, May 16 2007
a(n)= 4*a(n-1) -4*a(n-2) -a(n-3) +2*a(n-4). G.f.: (1-3*x^2)/((1-x) * (2*x-1) * (x^2+x-1)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 06 2010]
|
|
|
MAPLE
| seq(sum(2^x+fibonacci(x), x=0..a), a=0..30);
|
|
|
CROSSREFS
| Cf. A117591 (first differences). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 06 2010]
Sequence in context: A002804 A133649 A177144 * A008135 A009885 A052549
Adjacent sequences: A101350 A101351 A101352 * A101354 A101355 A101356
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Jorge Coveiro (jorgecoveiro(AT)yahoo.com), Dec 25 2004
|
| |
|
|
