login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A132228 a(n) = Sum_{k=0..n} C(n-1,k)^2*a(k)*a(n-k-1) for n>0 with a(0)=1. 2
1, 1, 2, 8, 52, 504, 6808, 122304, 2820048, 81183200, 2853990496, 120321094656, 5991955466560, 347996920977664, 23312947041336960, 1784445116557881344, 154767015393810489600, 15098457734490931766784 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Let A(x) = Sum_{n>=0} a(n) * x^n / n!^2. Then A(x)^2 = A'(x) + x * A''(x). - Michael Somos, May 20 2018

LINKS

Table of n, a(n) for n=0..17.

PROG

(PARI) a(n)=if(n==0, 1, sum(k=0, n-1, a(k)*a(n-k-1)*binomial(n-1, k)^2 ))

(PARI) {a(n) = my(A); if( n<0, 0, A = 1 + O(x); for( k=0, n, A = 1 + intformal( intformal(A^2) / x)); n!^2 * polcoeff(A, n))}; /* Michael Somos, May 20 2018 */

CROSSREFS

Cf. A001059.

Sequence in context: A103239 A209307 A323843 * A305004 A151879 A191552

Adjacent sequences:  A132225 A132226 A132227 * A132229 A132230 A132231

KEYWORD

nonn

AUTHOR

Paul D. Hanna, Aug 15 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 3 16:28 EDT 2021. Contains 346439 sequences. (Running on oeis4.)