cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A132228 #6 May 21 2018 02:33:55
%S A132228 1,1,2,8,52,504,6808,122304,2820048,81183200,2853990496,120321094656,
%T A132228 5991955466560,347996920977664,23312947041336960,1784445116557881344,
%U A132228 154767015393810489600,15098457734490931766784
%N 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.
%C A132228 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
%o A132228 (PARI) a(n)=if(n==0,1,sum(k=0,n-1,a(k)*a(n-k-1)*binomial(n-1,k)^2 ))
%o A132228 (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 */
%Y A132228 Cf. A001059.
%K A132228 nonn
%O A132228 0,3
%A A132228 _Paul D. Hanna_, Aug 15 2007