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 A377013 #6 Feb 16 2025 08:34:07 %S A377013 2,2,5,16,64,321,1927,13490,107921,971290,9712901,106841912, %T A377013 1282102945,16667338286,233342736005,3500141040076,56002256641217, %U A377013 952038362900690,17136690532212421,325597120112036000,6511942402240720001,136750790447055120022,3008517389835212640485 %N A377013 a(n) = floor(n!*(e - 1/24)). %D A377013 R. K. Guy, Unsolved Problems in Number Theory, Springer, 1st edition, 1981. See section E11. %H A377013 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SchursProblem.html">Schur's Problem</a>. %t A377013 a[n_]:=Floor[n!(E-1/24)]; Array[a,23,0] %Y A377013 Cf. A000522, A370973. %K A377013 nonn,easy %O A377013 0,1 %A A377013 _Stefano Spezia_, Oct 12 2024