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.

A356893 a(n) is the smallest number m such that m, m+1, m+2 and m+3 each have exactly n prime factors (counted with multiplicity).

This page as a plain text file.
%I A356893 #22 Aug 31 2025 15:48:29
%S A356893 602,4023,57967,8706123,296299374,4109290623,1691788490622,
%T A356893 59004826709373
%N A356893 a(n) is the smallest number m such that m, m+1, m+2 and m+3 each have exactly n prime factors (counted with multiplicity).
%C A356893 a(9) <= 1691788490622, a(10) <= 198629571578750, a(11) <= 3650742165781248. - _David A. Corneth_, Sep 04 2022
%C A356893 a(11) > 2 * 10^15. - _Toshitaka Suzuki_, Aug 31 2025
%e A356893 4023 = 3^3*149, 4024 = 2^3*503, 4025=5^2*7*23, 4026=2*3*11*61 (all products of four prime factors).
%Y A356893 Cf. A113752.
%K A356893 nonn,more,changed
%O A356893 3,1
%A A356893 _Zak Seidov_, Sep 03 2022
%E A356893 a(9)-a(10) from _Toshitaka Suzuki_, Aug 31 2025