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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129361 a(n)=sum{k=floor((n+1)/2)..n, F(k+1)}. 1
1, 1, 3, 5, 10, 16, 29, 47, 81, 131, 220, 356, 589, 953, 1563, 2529, 4126, 6676, 10857, 17567, 28513, 46135, 74792, 121016, 196041, 317201, 513619, 831053, 1345282, 2176712, 3522981, 5700303, 9224881 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (1,2,-1,0,-1,-1)

FORMULA

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

a(n) = A000045(n+3) - A103609(n+5). - R. J. Mathar, Mar 15 2011

MATHEMATICA

f[n_] := Sum[Fibonacci@k, {k, Floor[(n + 3)/2], n + 1}]; Array[f, 33, 0] (* Robert G. Wilson v, Mar 15 2011 *)

CROSSREFS

Cf. A129362.

Sequence in context: A070558 A070559 A000990 * A062773 A192757 A079934

Adjacent sequences:  A129358 A129359 A129360 * A129362 A129363 A129364

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Apr 11 2007

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 17 02:43 EST 2012. Contains 205978 sequences.