Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121675
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121675 a(n) = [x^n] (1 + x*(1+x)^(n+1) )^n. +0
4
1, 1, 7, 43, 371, 3926, 47622, 654151, 9999523, 167557174, 3046387103, 59616689595, 1247357472869, 27747682830531, 653192297754076, 16206706672425167, 422358302959175123, 11526119161103900834 (list; graph; listen)
OFFSET

0,3

FORMULA

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

EXAMPLE

At n=4, a(4) = [x^4] (1 + x*(1+x)^5 )^4 = 371, since

(1 + x*(1+x)^5 )^4 = 1 + 4*x + 26*x^2 + 104*x^3 + 371*x^4 +...

PROGRAM

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

CROSSREFS

Cf. variants: A121673, A121674, A121676-A121680.

Sequence in context: A126502 A042213 A127999 this_sequence A023316 A065786 A015463

Adjacent sequences: A121672 A121673 A121674 this_sequence A121676 A121677 A121678

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research