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 A387505 #6 Sep 06 2025 00:25:18 %S A387505 602,12122,632148,101905622,15605704374,1300091574624,431094129471872 %N A387505 Smallest number m such that m, m+1, m+2, m+3 and m+4 have exactly n prime factors (counted with multiplicity). %C A387505 a(10) > 2 * 10^15. %e A387505 a(4) = 12122 = 2*11*19*29, a(4)+1 = 12123 = 3^3*449, a(4)+2 = 12124 = 2^2*7*433, a(4)+3 = 12125 = 5^3*97, a(4)+4 = 12126 = 2*3*43*47 (all products of four prime factors). %Y A387505 Cf. A001222, A115186, A113752, A356893. %K A387505 nonn,hard,more,new %O A387505 3,1 %A A387505 _Toshitaka Suzuki_, Aug 31 2025