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.

A363387 G.f. A(x) satisfies: A(x) = x + x^2 * exp( Sum_{k>=1} A(x^k)^2 / (k*x^k) ).

This page as a plain text file.
%I A363387 #7 May 30 2023 19:38:39
%S A363387 1,1,1,3,6,17,42,120,330,962,2797,8334,24989,75905,232142,715830,
%T A363387 2220473,6928411,21723883,68424327,216376757,686742855,2186771571,
%U A363387 6984248840,22368127861,71818903891,231132440916,745454242656,2409080380316,7799945417349
%N A363387 G.f. A(x) satisfies: A(x) = x + x^2 * exp( Sum_{k>=1} A(x^k)^2 / (k*x^k) ).
%t A363387 nmax = 30; A[_] = 0; Do[A[x_] = x + x^2 Exp[Sum[A[x^k]^2/(k x^k), {k, 1, nmax}]] + O[x]^(nmax + 1)//Normal, nmax + 1]; CoefficientList[A[x], x] // Rest
%t A363387 a[1] = a[2] = 1; g[n_] := g[n] = Sum[a[k] a[n - k], {k, 1, n - 1}]; a[n_] := a[n] = (1/(n - 2)) Sum[Sum[d g[d + 1], {d, Divisors[k]}] a[n - k], {k, 1, n - 2}]; Table[a[n], {n, 1, 30}]
%o A363387 (PARI) seq(n)=my(p=x+x^2+O(x^3)); for(n=1, n\2, my(m=serprec(p,x)-1); p = x + x^2*exp(sum(k=1, m, subst(p + O(x^(m\k+1)), x, x^k)^2/(x^k*k)))); Vec(p + O(x*x^n)) \\ _Andrew Howroyd_, May 30 2023
%Y A363387 Cf. A005750, A007562, A363388.
%K A363387 nonn
%O A363387 1,4
%A A363387 _Ilya Gutkovskiy_, May 30 2023