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 A323634 #17 Aug 22 2020 11:08:32
%S A323634 1,1,3,12,80,723,8716,128227,2251086,45647542,1051845574,27107414480,
%T A323634 772785074811,24136982014698,819697939365724,30068912837398063,
%U A323634 1184872370227462528,49914074776385885492,2238476211786621770206,106476394492364281869654,5354276181476337307494676
%N A323634 Expansion of Product_{k>=1} 1/(1 - k^(k-1)*x^k).
%C A323634 This sequence is obtained from the generalized Euler transform in A266964 by taking f(n) = 1, g(n) = n^(n-1). - _Seiichi Manyama_, Aug 22 2020
%H A323634 Seiichi Manyama, <a href="/A323634/b323634.txt">Table of n, a(n) for n = 0..387</a>
%F A323634 a(n) ~ n^(n-1) * (1 + exp(-1)/n + (3*exp(-2) + 3*exp(-1)/2)/n^2). - _Vaclav Kotesovec_, Jan 22 2019
%p A323634 a:=series(mul(1/(1-k^(k-1)*x^k),k=1..100),x=0,21): seq(coeff(a,x,n),n=0..20); # _Paolo P. Lava_, Apr 02 2019
%t A323634 nmax = 20; CoefficientList[Series[Product[1/(1 - k^(k - 1) x^k), {k, 1, nmax}], {x, 0, nmax}], x]
%t A323634 a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d^(k - k/d + 1), {d, Divisors[k]}] a[n - k], {k, 1, n}]/n]; Table[a[n], {n, 0, 20}]
%o A323634 (PARI) N=40; x='x+O('x^N); Vec(1/prod(k=1, N, 1-k^(k-1)*x^k)) \\ _Seiichi Manyama_, Aug 22 2020
%Y A323634 Cf. A023879, A023882, A266964, A299786, A300579.
%K A323634 nonn
%O A323634 0,3
%A A323634 _Ilya Gutkovskiy_, Jan 21 2019