login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085373 a(n)=C(2n+1,n+1)C(n+2,2). 3
1, 9, 60, 350, 1890, 9702, 48048, 231660, 1093950, 5080790, 23279256, 105462084, 473227300, 2106121500, 9307051200, 40873466520, 178520875830, 775924068150, 3357800061000, 14473885526100, 62168784497820, 266168518910580 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

a(n)= A119578(n+1)/2 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 19 2008

FORMULA

a(n-1)=sum(i1+i2+...+in) where the sum is over 1<=i1<=i2<=...<=in<=n. G.f.: (1 - x)/(1 - 4x)^(5/2) - David Callan (callan(AT)stat.wisc.edu), Nov 20 2003

MAPLE

a:=n->sum(j, j=1..n)*binomial(2*n, n)/2: seq(a(n), n=1..22); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 08 2007

a:=n->sum((n+j)*binomial(2*n, n)/3!, j=0..n): seq(a(n), n=1..22); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 08 2007

a:=n->sum(sum(binomial(2*n, n)/4, j=1..n), k=0..n): seq(a(n), n=1..22); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 08 2007

with (combinat):seq (stirling2(n+1, n)*binomial(2*n, n)/2, n=1..22); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 19 2008

MATHEMATICA

Table[Binomial[2 n + 1, n + 1]Binomial[n + 2, 2], {n, 0, 30}]

PROG

(PARI) a(n)=binomial(2*n+1, n+1)*binomial(n+2, 2)

CROSSREFS

Cf. A002544.

Cf. A000984.

Sequence in context: A118674 A074431 A081904 * A082150 A026785 A153820

Adjacent sequences:  A085370 A085371 A085372 * A085374 A085375 A085376

KEYWORD

easy,nonn

AUTHOR

Mario Catalani (mario.catalani(AT)unito.it), Jun 26 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:08 EST 2012. Contains 205978 sequences.