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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105693 Fibonacci(2n+2)-2^n. 1
0, 1, 4, 13, 39, 112, 313, 859, 2328, 6253, 16687, 44320, 117297, 309619, 815656, 2145541, 5637351, 14799280, 38826025, 101809867, 266865720, 699311581, 1832117599, 4799138368, 12569491809, 32917725667, 86200462408, 225717215989 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..27.

Index to sequences with linear recurrences with constant coefficients, signature (5,-7,2).

FORMULA

G.f.: x(1-x)/((1-2x)(1-3x+x^2)); a(n)=sum{k=0..n+1, binomial(n+1, k+1)*sum{j=0..floor(k/2), F(k-2j)}}.

PROG

(MAGMA)[Fibonacci(2*n+2)-2^n: n in [0..30]]; // Vincenzo Librandi, Apr 21 2011

CROSSREFS

Cf. A061667.

Sequence in context: A058693 A027076 A183112 * A215404 A121192 A133409

Adjacent sequences:  A105690 A105691 A105692 * A105694 A105695 A105696

KEYWORD

easy,nonn

AUTHOR

Paul Barry, Apr 17 2005

STATUS

approved

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 June 19 16:47 EDT 2013. Contains 226415 sequences.