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 A330275 #24 Sep 08 2022 08:46:24 %S A330275 19,31,32,43,47,49,53,61,73,74,75,79,83,84,89,103,107,109,110,111,112, %T A330275 113,114,115,116,117,131,139,140,141,151,169,173,174,179,181,182,183, %U A330275 184,185,193,194,195,197,198,199,200,201,202,203,204,205,206,211,233 %N A330275 Integers n such that lcm(1, ..., n) > exp(n). %C A330275 It is well known that lcm(1, ..., n) is approximately exp(n). For most numbers < 100 it is less than exp(n). %H A330275 Robert Israel, <a href="/A330275/b330275.txt">Table of n, a(n) for n = 1..10000</a> %H A330275 J. Barkley Rosser and Lowell Schoenfeld, <a href="http://doi.org/10.1215/ijm/1255631807">Approximate formulas for some functions of prime numbers</a>, Illinois Journal of Mathematics, Vol. 6, No. 1 (1962), pp. 64-94. %p A330275 select(n -> is(ilcm($1..n) > exp(n)), [$1..300]); # _Robert Israel_, Dec 08 2019 %t A330275 Select[Range[233], LCM @@ Range[#] > Exp[#] &] (* _Amiram Eldar_, Dec 08 2019 *) %o A330275 (PARI) c=1; for (n=1, 233, c=lcm(c,n); if (c>exp(n), print1 (n", "))) \\ _Rémy Sigrist_, Dec 08 2019 %o A330275 (Magma) [k:k in [1..250]|Lcm([1..k]) gt Exp(k)]; // _Marius A. Burtea_, Dec 16 2019 %Y A330275 Cf. A003418. %K A330275 nonn %O A330275 1,1 %A A330275 _Wendy Appleby_, Dec 08 2019 %E A330275 More terms from _Rémy Sigrist_, Dec 08 2019