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 A259113 #7 Jun 18 2015 16:36:27
%S A259113 1,40320,18598035456000,474009962689446543360000,
%T A259113 170149872975531014630262649651200000,
%U A259113 442695618409212548301531680485487369256960000000,5620045472937667963281036681944526735620775198955929600000000
%N A259113 E.g.f. satisfies: A(x) = Integral 1 + A(x)^8 dx.
%C A259113 In general, for k>2, if e.g.f. satisfies A(x) = Integral 1 + A(x)^k dx, then a(n) ~ k^(k/(k-1)) * n^(1/(k-1)) * (k*n)! * (k*sin(Pi/k)/Pi)^(k*n + k/(k-1)) / ((k-1)^(1/(k-1)) * Gamma(1/(k-1))).
%H A259113 Vaclav Kotesovec, <a href="/A259113/b259113.txt">Table of n, a(n) for n = 0..56</a>
%F A259113 a(n) ~ 2^(24*n+48/7) * n^(1/7) * (sin(Pi/8)/Pi)^(8*n+8/7) * (8*n)! / (7^(1/7) * GAMMA(1/7)).
%F A259113 a(n) ~ 2^(16*n+40/7) * (2-sqrt(2))^(4*n+4/7) * n^(1/7) * (8*n)! / (7^(1/7) * GAMMA(1/7) * Pi^(8*n+8/7)).
%o A259113 (PARI) {a(n) = local(A=x); A = serreverse( intformal( 1/(1 + x^8 + O(x^(8*n+2))) ) ); (8*n+1)!*polcoeff(A, 8*n+1)}
%o A259113 for(n=0, 20, print1(a(n), ", ")) \\ after _Paul D. Hanna_
%Y A259113 Cf. A258880 (k=3), A258901 (k=4), A258925 (k=5), A258927 (k=6), A259112 (k=7).
%K A259113 nonn
%O A259113 0,2
%A A259113 _Vaclav Kotesovec_, Jun 18 2015