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 A075044 #15 Apr 10 2025 16:06:36
%S A075044 1,2,14,644,134043,129963314,626804494291
%N A075044 a(0) = 1; a(n) = the smallest number k such that n numbers from k to k+n-1 have n distinct prime divisors, or 0 if no such number exists.
%C A075044 a(7) <= 45164156742722455667280. - _Giorgos Kalogeropoulos_, Apr 10 2025
%t A075044 Do[k = 1; While[Length /@ FactorInteger /@ Range[k, k+n-1] != Table[n, {n}], k++ ]; Print[k], {n, 0, 5}] (* _Ryan Propper_, Oct 01 2005 *)
%Y A075044 Cf. A006049, A045983, A006073.
%K A075044 nonn,more
%O A075044 0,2
%A A075044 _Amarnath Murthy_, Sep 03 2002
%E A075044 Corrected and extended by _Ryan Propper_, Oct 01 2005
%E A075044 Offset corrected and a(6) from _Donovan Johnson_, Aug 03 2009