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 A352070 #32 Sep 07 2023 03:01:46
%S A352070 1,1,1,10,10,604,-1844,107344,-1201400,42193576,-875584376,
%T A352070 29853569008,-880141783184,32865860907424,-1216481572723616,
%U A352070 51296026356128512,-2244334822166729600,106984479644794783360,-5358207684820194270080,286466413246622566048000
%N A352070 Expansion of e.g.f. 1/(1 - log(1 + 3*x))^(1/3).
%F A352070 a(n) = Sum_{k=0..n} 3^(n-k) * (Product_{j=0..k-1} (3*j+1)) * Stirling1(n,k).
%F A352070 For n > 0, a(n) = n!*Sum_{k=1..n} a(n-k)*(2/n/3-1/k)*(-3)^k/(n-k)!. - _Tani Akinari_, Sep 07 2023
%F A352070 a(n) ~ -(-1)^n * 3^(n-1) * n! / (n * log(n)^(4/3)) * (1 - 4*(1+gamma)/(3*log(n))), where gamma is the Euler-Mascheroni constant A001620. - _Vaclav Kotesovec_, Sep 07 2023
%t A352070 m = 19; Range[0, m]! * CoefficientList[Series[(1 - Log[1 + 3*x])^(-1/3), {x, 0, m}], x] (* _Amiram Eldar_, Mar 05 2022 *)
%t A352070 Table[Sum[3^(n-k) * Product[3*j+1, {j,0,k-1}] * StirlingS1[n,k], {k,0,n}], {n,0,20}] (* _Vaclav Kotesovec_, Sep 07 2023 *)
%o A352070 (PARI) my(N=20, x='x+O('x^N)); Vec(serlaplace(1/(1-log(1+3*x))^(1/3)))
%o A352070 (PARI) a(n) = sum(k=0, n, 3^(n-k)*prod(j=0, k-1, 3*j+1)*stirling(n, k, 1));
%o A352070 (Maxima) a[n]:=if n=0 then 1 else n!*sum(a[n-k]*(2/n/3-1/k)*(-3)^k/(n-k)!,k,1,n);
%o A352070 makelist(a[n],n,0,50); /* _Tani Akinari_, Sep 07 2023 */
%Y A352070 Cf. A006252, A097397, A352073.
%Y A352070 Cf. A007559, A133480, A352113, A352118.
%K A352070 sign
%O A352070 0,4
%A A352070 _Seiichi Manyama_, Mar 05 2022