Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100132
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100132 Sum C(n-2k,2k)2^(n-3k), k=0..floor(n/4). +0
3
1, 2, 4, 8, 18, 44, 112, 288, 740, 1896, 4848, 12384, 31624, 80752, 206208, 526592, 1344784, 3434272, 8770368, 22397568, 57198368, 146071744, 373034240, 952645120, 2432840256, 6212924032, 15866403584, 40519208448, 103476899968 (list; graph; listen)
OFFSET

0,2

COMMENT

Binomial transform of 1,1,1,1,3,3,7,7,41,... (g.f. (1-x)(1+x)^2/(1-2x^2-x^4)).

FORMULA

G.f.: (1-2x)/((1-2x)^2-2x^4); a(n)=4a(n-1)-4a(n-2)+2a(n-3).

a(n)=sum{k=0..floor(n/2), C(n-k, k)2^(n-3k/2)(1+(-1)^k)/2} - Paul Barry (pbarry(AT)wit.ie), Jan 22 2005

CROSSREFS

Cf. A100131, A100133.

Sequence in context: A052327 A059221 A114203 this_sequence A088457 A006786 A125809

Adjacent sequences: A100129 A100130 A100131 this_sequence A100133 A100134 A100135

KEYWORD

easy,nonn

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Nov 06 2004

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research