cp's OEIS Frontend

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.

A113752 Smallest number m such that m, m+1 and m+2 have exactly n prime factors (counted with multiplicity).

This page as a plain text file.
%I A113752 #22 Aug 31 2025 19:20:02
%S A113752 33,170,1274,15470,33614,3145310,40909374,668363967,9864741248,
%T A113752 179199427328,967461818750,57938945781248,597779386906624
%N A113752 Smallest number m such that m, m+1 and m+2 have exactly n prime factors (counted with multiplicity).
%C A113752 n = A001222(a(n)) = A001222(a(n)+1) = A001222(a(n)+2). Subsequence of A045920.
%C A113752 a(14) <= 1247579465781248. - _Donovan Johnson_, Jun 12 2013
%C A113752 a(15) > 2 * 10^15. - _Toshitaka Suzuki_, Aug 31 2025
%e A113752 a(6) = 33614 = 2*7*7*7*7*7, a(6)+1 = 3*3*3*3*5*83, a(6)+2 = 2*2*2*2*11*191
%t A113752 t = {}; n = 2; m = 1; While[Length[t] < 5, m++; If[n == PrimeOmega[m] == PrimeOmega[m + 1] == PrimeOmega[m + 2], AppendTo[t, m]; n++]]; t (* _T. D. Noe_, Aug 19 2013 *)
%Y A113752 Cf. A001222, A045920, A093549, A093550, A115186.
%K A113752 nonn,hard,more,changed
%O A113752 2,1
%A A113752 _Martin Fuller_, Jan 17 2006
%E A113752 a(9)-a(11) from _Donovan Johnson_, Apr 08 2008
%E A113752 a(12) from _Donovan Johnson_, Aug 08 2011
%E A113752 a(13) from _Jud McCranie_, Aug 19 2013
%E A113752 a(14) from _Toshitaka Suzuki_, Aug 31 2025