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 A071192 #18 Mar 21 2025 14:38:35
%S A071192 2,4,4,5,6,7,9,9,11,11,14,14,14,17,17,18,21,21,21,21,23,23,25,27,27,
%T A071192 27,33,33,33,33,33,36,37,37,37,42,38,41,41,42,46,46,46,46,46,47,49,54,
%U A071192 50,51,52,54,55,63,59,63,59,59,62,63,62,63,65
%N A071192 Least m>n such that the number of prime factors of m and n differ by 1.
%H A071192 David A. Corneth, <a href="/A071192/b071192.txt">Table of n, a(n) for n = 1..10000</a>
%F A071192 abs(A001222(a(n)) - A001222(n)) = 1.
%e A071192 a(11) = 14 as 11 has one prime factor (counted with multiplicity) and 14 has 2 prime factors (counted with multiplicity) 14 the smallest number m > 11 such that the number of prime factors of m and 11 differ by 1. - _David A. Corneth_, Feb 23 2024
%o A071192 (PARI)
%o A071192 a(n) = {
%o A071192 my(b = bigomega(n));
%o A071192 for(i = n + 1, oo,
%o A071192 if(abs(bigomega(i)-b) == 1,
%o A071192 return(i)
%o A071192 )
%o A071192 )
%o A071192 } \\ _David A. Corneth_, Feb 23 2024
%o A071192 (PARI) a(n) = my(b=bigomega(n), k=n+1); while(abs(bigomega(k) - b) != 1, k++); k; \\ _Michel Marcus_, Mar 21 2025
%Y A071192 Cf. A001222, A071191, A071193.
%K A071192 nonn
%O A071192 1,1
%A A071192 _Reinhard Zumkeller_, May 15 2002