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.

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

This page as a plain text file.
%I A363389 #7 May 30 2023 19:56:01
%S A363389 1,2,11,72,545,4432,38081,339266,3107841,29080910,276786032,
%T A363389 2671136262,26076724707,257061506994,2555287226253,25584395476368,
%U A363389 257780104545994,2611791146130284,26593326491738879,271972643143865548,2792566207778712513,28776796478486084250
%N A363389 G.f. A(x) satisfies: A(x) = x * exp(2 * Sum_{k>=1} A(x^k)^2 / (k*x^k) ).
%t A363389 nmax = 22; A[_] = 0; Do[A[x_] = x Exp[2 Sum[A[x^k]^2/(k x^k), {k, 1, nmax}]] + O[x]^(nmax + 1)//Normal, nmax + 1]; CoefficientList[A[x], x] // Rest
%t A363389 a[1] = 1; g[n_] := g[n] = Sum[a[k] a[n - k], {k, 1, n - 1}]; a[n_] := a[n] = (2/(n - 1)) Sum[Sum[d g[d + 1], {d, Divisors[k]}] a[n - k], {k, 1, n - 1}]; Table[a[n], {n, 1, 22}]
%o A363389 (PARI) seq(n)=my(p=x+O(x^2)); for(n=2, n, my(m=serprec(p,x)-1); p = x*exp(2*sum(k=1, m, subst(p + O(x^(m\k+1)), x, x^k)^2/(x^k*k)))); Vec(p) \\ _Andrew Howroyd_, May 30 2023
%Y A363389 Cf. A000151, A005750, A363390.
%K A363389 nonn
%O A363389 1,2
%A A363389 _Ilya Gutkovskiy_, May 30 2023