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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063902 a(n+1) = sum{j = 0,...n}[C(2n,2j)a(j)a(n-j)] with a(0) = 1. 0
1, 1, 2, 10, 80, 1000, 17600, 418000, 12848000, 496672000, 23576960000, 1348404640000, 91442700800000, 7255463564800000, 665885747225600000 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

EXAMPLE

a(3) = 1*a(0)a(2)+6*a(1)a(1)+1*a(2)a(0) = 2+6+2 = 10.

CROSSREFS

a(n+1) = sum[C(n, j)a(j)a(n-j)] would give factorials A000142, a(n+1) = sum[C(2n, 2j)a(j)a(n-j)]/a(n) would give Catalan numbers A000108, a(n+1) = sum[C(n, j)a(j)a(n-j)]/a(n) would give central binomials A001405.

Sequence in context: A133480 A008544 A064312 * A088351 A174962 A062396

Adjacent sequences:  A063899 A063900 A063901 * A063903 A063904 A063905

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Aug 30 2001

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 17:51 EST 2012. Contains 206061 sequences.