Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129361
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129361 a(n)=sum{k=floor((n+1)/2)..n, F(k+1)}. +0
2
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; listen)
OFFSET

0,3

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)}

CROSSREFS

Cf. A129362.

Sequence in context: A070558 A070559 A000990 this_sequence A062773 A079934 A005403

Adjacent sequences: A129358 A129359 A129360 this_sequence A129362 A129363 A129364

KEYWORD

easy,nonn

AUTHOR

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

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 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research