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 A346974 #10 Jan 23 2025 08:31:02
%S A346974 1,3,4,-15,-134,-357,2374,33645,133186,-1288617,-24887906,-130115895,
%T A346974 1666879306,40612637523,262868197414,-4221449488635,-123802488449774,
%U A346974 -952293015617937,18497401668708334,632675912865355425,5622243546094977946,-128799294291220310997
%N A346974 Expansion of e.g.f. log( 1 + (exp(x) - 1)^2 / 2 ).
%F A346974 a(n) = Stirling2(n,2) - (1/n) * Sum_{k=1..n-1} binomial(n,k) * Stirling2(n-k,2) * k * a(k).
%F A346974 a(n) ~ -n! * 2^(n+1) * cos(n*arctan(2*arctan(sqrt(2))/log(3))) / (n * (4*arctan(sqrt(2))^2 + log(3)^2)^(n/2)). - _Vaclav Kotesovec_, Aug 09 2021
%F A346974 a(n) = Sum_{k=1..floor(n/2)} (-1)^(k-1) * (2*k)! * Stirling2(n,2*k)/(k * 2^k). - _Seiichi Manyama_, Jan 23 2025
%t A346974 nmax = 23; CoefficientList[Series[Log[1 + (Exp[x] - 1)^2/2], {x, 0, nmax}], x] Range[0, nmax]! // Drop[#, 2] &
%t A346974 a[n_] := a[n] = StirlingS2[n, 2] - (1/n) Sum[Binomial[n, k] StirlingS2[n - k, 2] k a[k], {k, 1, n - 1}]; Table[a[n], {n, 2, 23}]
%Y A346974 Cf. A000225, A003704, A060311, A346975, A346976, A346977.
%K A346974 sign
%O A346974 2,2
%A A346974 _Ilya Gutkovskiy_, Aug 09 2021