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.
%I A161605 #6 Nov 18 2017 01:40:19 %S A161605 1,1,3,28,365,6496,147127,4033408,130058777,4822981120,202225551371, %T A161605 9460961327104,488602134968389,27609977350868992,1694576741234926655, %U A161605 112258296102497099776,7983577042683934226993,606688287932557859356672 %N A161605 E.g.f. satisfies: A(x) = exp(x*exp(x*A(x)^3)). %C A161605 More generally, if G(x) = exp(x*exp(x*G(x)^p)), %C A161605 where G(x)^m = Sum_{n>=0} g(n,m)*x^n/n!, %C A161605 then g(n,m) = Sum_{k=0..n} C(n,k) * m*(p*(n-k) + m)^(k-1) * k^(n-k). %H A161605 G. C. Greubel, <a href="/A161605/b161605.txt">Table of n, a(n) for n = 0..355</a> %F A161605 a(n) = Sum_{k=0..n} C(n,k) * (3*(n-k) + 1)^(k-1) * k^(n-k). %e A161605 E.g.f.: A(x) = 1 + x + 3*x^2/2! + 28*x^3/3! + 365*x^4/4! +... %t A161605 Flatten[{1, Table[Sum[Binomial[n, k]*(3*(n - k) + 1)^(k - 1)*k^(n - k), {k, 0, n}], {n, 1, 50}]}] (* _G. C. Greubel_, Nov 18 2017 *) %o A161605 (PARI) {a(n)=sum(k=0,n,binomial(n,k)*(3*(n-k)+1)^(k-1)*k^(n-k))} %o A161605 (PARI) {a(n)=local(A=1+x);for(i=0,n,A=exp(x*exp(x*A^3+O(x^n))));n!*polcoeff(A,n,x)} %Y A161605 Cf. A161552, A161567. %K A161605 nonn %O A161605 0,3 %A A161605 _Paul D. Hanna_, Jun 14 2009