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 A226082 #13 Dec 25 2023 17:55:33
%S A226082 97,1361,24586,73757
%N A226082 Number of daughters to wait before picking in the sultan's dowry problem that is not equal to round(n*e^(-1 - 1/(2*n))).
%C A226082 Numbers n such that A054404(n) is not equal to A226033(n).
%t A226082 li[n_] := -1/2* 1/ProductLog[-Exp[1 - 1/((2 n - 2))]/(2n-2)]; Table[If[! Round[n*E^(-1 - 1/(2*n))] == Ceiling[li[n]], Print[n]; n], {n, 4, 1000000}]
%Y A226082 Cf. A054404, A226033.
%K A226082 nonn,hard
%O A226082 1,1
%A A226082 _José María Grau Ribas_, May 25 2013