Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,8

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: A031438 A096964 A123254 this_sequence A051343 A131193 A130632

Adjacent sequences: A119966 A119967 A119968 this_sequence A119970 A119971 A119972

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Jun 01 2006

page 1

Search completed in 0.005 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research