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 A248695 #14 Feb 27 2025 03:27:57
%S A248695 2,9,2,4,9,9,2,7,8,7,4,3,1,2,8,5,5,1,4,5,0,0,1,5,6,0,9,4,1,7,4,4,2,4,
%T A248695 0,1,3,2,8,9,9,8,3,9,3,1,0,2,2,9,3,1,2,1,8,0,5,0,9,4,1,3,2,9,6,8,6,9,
%U A248695 2,5,8,8,3,7,3,3,9,2,4,9,3,5,3,5,4,7
%N A248695 Decimal expansion of Sum_{n >= 1} n!/p(n), where p(n) = [n/2]!*[n/3]!*...*[n/n]!, and [ ] = floor.
%C A248695 Let t(n) = n!/p(n). Then t(n) is an integer for n = 1..15, and max{t(n), n = 1..infinity} = t(23) = 77462.802... . It appears that t(n) < 1/10 for n > 35 and t(n) < 10^(-6) for n > 45.
%e A248695 292499.27874312855145001560941744240132899839310229312180509413296869258837339...
%p A248695 evalf(sum(n!/product(floor(n/k)!, k=2..n), n=1..infinity), 120); # _Vaclav Kotesovec_, Oct 19 2014
%t A248695 u = N[Sum[n!/Product[Floor[n/k]!, {k, 2, n}], {n, 1, 200}], 130]
%t A248695 RealDigits[u] (* A248695 *)
%Y A248695 Cf. A214869, A248696.
%K A248695 nonn,easy,cons
%O A248695 6,1
%A A248695 _Clark Kimberling_, Oct 13 2014
%E A248695 Name corrected by _Jason Yuen_, Feb 27 2025