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 A247968 #55 Feb 16 2025 08:33:23
%S A247968 1,1,1,2,3,6,11,22,43,86,171,342,683,1366,2731,5462,10923,21846,43691,
%T A247968 87382,174763,349526,699051,1398102,2796203,5592406,11184811,22369622
%N A247968 a(n) = least k such that (k!*e^k)/(sqrt(2*Pi)*k^(k+1/2)) - 1 < 1/2^n.
%C A247968 Is a(n) = A005578(n-2) for n >= 2?
%C A247968 A proof would likely follow from applying Stirling's formula to k!. - _R. J. Mathar_, Oct 07 2014
%C A247968 a(n) is the least k such that the Stirling approximation to k! underestimates the real value by a factor of less than 1/2^k. The MathWorld link notes that replacing sqrt(2k) with sqrt(2k+1/3) in Stirling's approximation gives a much closer approximation of k!, which leads to the formula a(n) = ceiling(2^n/12). - _Charlie Neder_, Mar 06 2019 [corrected by _Jon E. Schoenfield_, Dec 18 2022]
%D A247968 Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, p. 18 (Stirling's formula).
%H A247968 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/StirlingsApproximation.html">Stirling's Approximation</a>.
%t A247968 z = 100; s[n_] := s[n] = (n!*E^n)/(Sqrt[2*Pi]*n^(n + 1/2));
%t A247968 N[Table[s[n], {n, 1, z}], 10]
%t A247968 f[n_] := f[n] = Select[Range[6000], s[#] - 1 < 1/2^n &, 1]
%t A247968 Flatten[Table[f[n], {n, 1, z}]]
%t A247968 (* alternate program *)
%t A247968 Table[k=1;Monitor[Parallelize[While[True,If[((Factorial[k]*Exp[k])/(Sqrt[2*Pi]*k^(k+(1/2))))-1<1/2^n,Break[]];k++];k],k],{n,1,10}] (* _J.W.L. (Jan) Eerland_, Dec 08 2022 *)
%Y A247968 Cf. A005578.
%K A247968 nonn,more
%O A247968 1,4
%A A247968 _Clark Kimberling_, Sep 28 2014
%E A247968 Name corrected by _David A. Corneth_, Mar 06 2019
%E A247968 a(17)-a(28) from _J.W.L. (Jan) Eerland_, Jan 04 2023