Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129384
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129384 a(n)=sum{k=0..floor(n/2), C(n-k,floor((n-k)/2))}. +0
2
1, 1, 3, 5, 11, 19, 39, 71, 141, 261, 513, 965, 1889, 3585, 7017, 13417, 26287, 50527, 99147, 191399, 376155, 728619, 1434051, 2785667, 5489823, 10689199, 21089799, 41146383, 81262983, 158818311, 313935831, 614469591, 1215549981 (list; graph; listen)
OFFSET

0,3

COMMENT

Partial sums of A129383.

FORMULA

G.f.: (1/(1-x))(g(x)-x*g(x^2)), g(x) the g.f. of A001405; a(n)=sum{k=floor((n+1)/2)..n, C(k,floor(k/2))}

CROSSREFS

Adjacent sequences: A129381 A129382 A129383 this_sequence A129385 A129386 A129387

Sequence in context: A134127 A078722 A089098 this_sequence A131887 A045691 A045961

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Apr 12 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 October 11 13:47 EDT 2008. Contains 144830 sequences.


AT&T Labs Research