login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119969 Sum{k>=0, C(2^k-1,n-2*(2^k-1))}. 1
1, 0, 1, 1, 0, 0, 1, 3, 3, 1, 0, 0, 0, 0, 1, 7, 21, 35, 35, 21, 7, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 15, 105, 455, 1365, 3003, 5005, 6435, 6435, 5005, 3003, 1365, 455, 105, 15, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 31, 465, 4495, 31465, 169911, 736281, 2629575 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
FORMULA
G.f.: sum{k>=0, (x^2*(1+x))^(2k-1)}; a(n)=sum{k=0..floor(n/2), C(k,n-2k)*mod(C(k),2)}; a(n)=sum{k=0..floor(n/2), C(k,n-2k)*A036987(k)}.
CROSSREFS
Sequence in context: A096964 A350483 A123254 * A051343 A356326 A261477
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Jun 01 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 03:59 EDT 2024. Contains 371798 sequences. (Running on oeis4.)