Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121690
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121690 G.f.: A(x) = Sum_{k>=0} x^k * (1+x)^(k*(k+1)/2). +0
2
1, 1, 2, 4, 10, 27, 81, 262, 910, 3363, 13150, 54135, 233671, 1053911, 4951997, 24177536, 122381035, 640937746, 3466900453, 19337255086, 111057640382, 655892813805, 3978591077096, 24760700544301, 157941950878839 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = Sum_{k=0..n} C(k*(k+1)/2,n-k).

a(n) = A131338(n+1, n*(n+1)/2 + 1) for n>=0, where triangle A131338 starts with a '1' in row 0 and then for n>0 row n consists of n '1's followed by the partial sums of the prior row. - Paul D. Hanna (pauldhanna(AT)juno.com), Aug 30 2007

PROGRAM

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

CROSSREFS

Cf. A131338.

Adjacent sequences: A121687 A121688 A121689 this_sequence A121691 A121692 A121693

Sequence in context: A114507 A127386 A099950 this_sequence A138356 A057786 A007776

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 15 2006

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 13 17:46 EDT 2008. Contains 145008 sequences.


AT&T Labs Research