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.

A221100 E.g.f. satisfies: A(x) = 1 + x*Sum_{n>=0} log(A(n*x))^n / n!.

This page as a plain text file.
%I A221100 #7 Sep 11 2024 14:13:59
%S A221100 1,1,2,15,248,8440,513144,52356122,8677146176,2287135119744,
%T A221100 948641529992880,614727594325073592,618434779929242165856,
%U A221100 960690586903797786948288,2293100087767812293312717088,8373182505242530234213019810880,46591358758492418174191908438641664
%N A221100 E.g.f. satisfies: A(x) = 1 + x*Sum_{n>=0} log(A(n*x))^n / n!.
%e A221100 E.g.f.: A(x) = 1 + x + 2*x^2/2! + 15*x^3/3! + 248*x^4/4! + 8440*x^5/5! +...
%e A221100 where
%e A221100 A(x) = 1 + x + x*log(A(x)) + x*log(A(2*x))^2/2! + x*log(A(3*x))^3/3! + x*log(A(4*x))^4/4! + x*log(A(5*x))^5/5! +...
%o A221100 (PARI) {a(n)=local(A=1+x); for(i=1, n, A=1+x*sum(m=0, n, log( subst(A,x,m*x+x*O(x^n)) )^m/m!)); n!*polcoeff(A, n)}
%o A221100 for(n=0,20,print1(a(n),", "))
%Y A221100 Cf. A221101.
%K A221100 nonn
%O A221100 0,3
%A A221100 _Paul D. Hanna_, Jan 01 2013