Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137155
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137155 a(n) = Sum_{k=0..[n/2]} C(2^k + n-2k-1, n-2k); equals the antidiagonal sums of triangle A137153. +0
3
1, 1, 2, 3, 5, 9, 17, 35, 80, 201, 561, 1771, 6298, 25217, 115440, 605243, 3609754, 24742305, 196470603, 1792166979, 18817616610, 230233601737, 3268914688382, 53509699527491, 1020486454701731, 22777217813040393, 589097686208575727 (list; graph; listen)
OFFSET

0,3

PROGRAM

(PARI) a(n)=sum(k=0, n\2, binomial(2^k+n-2*k-1, n-2*k))

CROSSREFS

Cf. A137153, A137154.

Adjacent sequences: A137152 A137153 A137154 this_sequence A137156 A137157 A137158

Sequence in context: A094373 A061902 A110113 this_sequence A014227 A064769 A119002

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jan 24 2008

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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research