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 A336258 #12 Jan 04 2024 19:08:45
%S A336258 1,1,5,58,1208,39476,1861372,119587224,10040970816,1067383279872,
%T A336258 140110136642304,22256626639796352,4207858001708629248,
%U A336258 933704296260740939520,240293228328619963492608,70992050129486593239246336,23863916105454465092261412864
%N A336258 a(0) = 1; a(n) = (n!)^2 * Sum_{k=0..n-1} a(k) / (k! * (n-k))^2.
%H A336258 Alois P. Heinz, <a href="/A336258/b336258.txt">Table of n, a(n) for n = 0..247</a>
%F A336258 a(n) = (n!)^2 * [x^n] 1 / (1 - polylog(2,x)).
%F A336258 a(n) ~ (n!)^2 / (-log(1-r) * r^n), where r = 0.76154294453204558806805187241... is the root of the equation polylog(2,r) = 1. - _Vaclav Kotesovec_, Jul 15 2020
%p A336258 b:= proc(n) option remember; `if`(n=0, 1,
%p A336258 add(b(n-i)/i^2, i=1..n))
%p A336258 end:
%p A336258 a:= n-> n!^2*b(n):
%p A336258 seq(a(n), n=0..16); # _Alois P. Heinz_, Jan 04 2024
%t A336258 a[0] = 1; a[n_] := a[n] = (n!)^2 Sum[a[k]/(k! (n - k))^2, {k, 0, n - 1}]; Table[a[n], {n, 0, 16}]
%t A336258 nmax = 16; CoefficientList[Series[1/(1 - PolyLog[2, x]), {x, 0, nmax}], x] Range[0, nmax]!^2
%Y A336258 Cf. A007840, A074707, A102221, A336243, A336259, A336260, A336261.
%K A336258 nonn
%O A336258 0,3
%A A336258 _Ilya Gutkovskiy_, Jul 15 2020