Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038112
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038112 T(2n,n), where T(n,k) is in A037027. +0
4
1, 2, 9, 40, 190, 924, 4578, 22968, 116325, 593450, 3045185, 15699840, 81260816, 421993040, 2197653240, 11472991008, 60023749566, 314621200260, 1651883008050, 8685998428800, 45734484854520, 241098942106440 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n):=sum{k=0..n, C(n+k,k)C(k,n-k)}; - Paul Barry (pbarry(AT)wit.ie), May 13 2006

a(n) = sum(binomial(2*j,n)*(binomial(n+j,2*j)),j=0..n). - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Aug 22 2006

MAPLE

a:=n->sum(binomial(2*j, n)*(binomial(n+j, 2*j)), j=0..n): seq(a(n), n=0..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Aug 22 2006

PROGRAM

(PARI) a(n)=if(n<0, 0, sum(k=0, n\2, (2*n-k)!/k!/(n-2*k)!)/n!) (from Michael Somos)

(PARI) a(n)=if(n<0, 0, n++; n*polcoeff(serreverse(x-x^2-x^3+x*O(x^n)), n)) (from Michael Somos)

CROSSREFS

a(n)=(n+1)A001002(n+1).

Sequence in context: A020728 A107979 A021001 this_sequence A052512 A166554 A038156

Adjacent sequences: A038109 A038110 A038111 this_sequence A038113 A038114 A038115

KEYWORD

nonn

AUTHOR

Floor van Lamoen (fvlamoen(AT)hotmail.com)

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


AT&T Labs Research