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 A168243 #33 Sep 30 2024 20:47:24
%S A168243 1,1,1,5,11,59,439,2659,13705,160649,2009681,16966421,183312931,
%T A168243 2078169235,34203787591,657685416179,8054585463569,104530824746129,
%U A168243 2595754682459425,39767021562661669,758079429084897211
%N A168243 Expansion of e.g.f. Product_{i>=1} (1 + x^i)^(1/i).
%H A168243 Vaclav Kotesovec, <a href="/A168243/b168243.txt">Table of n, a(n) for n = 0..446</a>
%H A168243 Vaclav Kotesovec, <a href="/A168243/a168243_2.jpg">Graph: (a(n)/n!) / (n^(log(2) - 1)), 250000 terms</a>
%H A168243 Lida Ahmadi, Ricardo Gómez Aíza, and Mark Daniel Ward, <a href="https://doi.org/10.1007/s44007-024-00134-w">A unified treatment of families of partition functions</a>, La Matematica (2024). Preprint available as <a href="https://arxiv.org/abs/2303.02240">arXiv:2303.02240</a> [math.CO], 2023.
%F A168243 E.g.f.: exp(Sum_{n>=1} A048272(n)*x^n/n).
%F A168243 Conjecture: log(a(n)/n!) ~ (log(2) - 1) * log(n). - _Vaclav Kotesovec_, Sep 10 2018
%t A168243 nmax=20; CoefficientList[Series[Product[(1+x^k)^(1/k),{k,1,nmax}],{x,0,nmax}],x] * Range[0,nmax]! (* _Vaclav Kotesovec_, May 28 2015 *)
%t A168243 a[n_] := a[n] = If[n == 0, 1, Sum[Sum[-(-1)^d, {d, Divisors[k]}]*a[n-k], {k, 1, n}]/n]; Table[n!*a[n], {n, 0, 20}] (* _Vaclav Kotesovec_, Sep 07 2018 *)
%Y A168243 Cf. A028342.
%K A168243 easy,nonn
%O A168243 0,4
%A A168243 _Vladeta Jovovic_, Nov 21 2009