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 A341588 #11 Jun 04 2022 04:10:59
%S A341588 1,12,130,1485,18508,253400,3805723,62437500,1113510409,21479997957,
%T A341588 446094038806,9930796412082,236037249893092,5968192832899412,
%U A341588 160007282538148508,4534905316824903144,135500246340709682692,4257646241716404353684,140366073694357927723936,4845119946789226304526392
%N A341588 E.g.f.: -log(1 + log(1 - x))^3 / 6.
%H A341588 Seiichi Manyama, <a href="/A341588/b341588.txt">Table of n, a(n) for n = 3..418</a>
%F A341588 a(n) = Sum_{k=3..n} |Stirling1(n, k) * Stirling1(k, 3)|.
%F A341588 a(n) ~ (n-1)! * log(n)^2 / (2 * (1 - exp(-1))^n) * (1 + (2*gamma - 2*log(exp(1) - 1)) / log(n) + (gamma^2 - Pi^2/6 - 2*log(exp(1) - 1)*gamma + log(exp(1)-1)^2) / log(n)^2). - _Vaclav Kotesovec_, Jun 04 2022
%t A341588 nmax = 22; CoefficientList[Series[-Log[1 + Log[1 - x]]^3/6, {x, 0, nmax}], x] Range[0, nmax]! // Drop[#, 3] &
%t A341588 Table[Sum[Abs[StirlingS1[n, k] StirlingS1[k, 3]], {k, 3, n}], {n, 3, 22}]
%Y A341588 Cf. A000399, A000559, A003713, A008275, A039814, A341587.
%K A341588 nonn
%O A341588 3,2
%A A341588 _Ilya Gutkovskiy_, Feb 15 2021