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 A071191 #11 Feb 23 2024 15:29:42
%S A071191 2,3,4,5,6,7,9,9,10,11,13,14,14,15,17,18,19,20,21,21,22,23,25,27,26,
%T A071191 27,28,30,31,33,33,36,34,35,37,40,38,39,41,42,43,44,46,45,46,47,49,54,
%U A071191 50,51,52,54,55,56,57,60,58,59,61,63,62,63,65
%N A071191 Least m>n such that the number of prime factors of m and n differ at most by 1.
%C A071191 abs(A001222(a(n)) - A001222(n)) <= 1.
%H A071191 David A. Corneth, <a href="/A071191/b071191.txt">Table of n, a(n) for n = 1..10000</a>
%e A071191 a(11) = 13 as 11 has one prime factor (counted with multiplicity) and 13 has 1 prime factor (counted with multiplicity), 13 the smallest number m > 11 such that the number of prime factors of m and 11 differ by at most 1. - _David A. Corneth_, Feb 23 2024
%o A071191 (PARI)
%o A071191 a(n) = {
%o A071191 my(b = bigomega(n));
%o A071191 for(i = n + 1, oo,
%o A071191 if(abs(bigomega(i)-b) <= 1,
%o A071191 return(i)
%o A071191 )
%o A071191 )
%o A071191 } \\ _David A. Corneth_, Feb 23 2024
%Y A071191 Cf. A071192, A071193.
%K A071191 nonn
%O A071191 1,1
%A A071191 _Reinhard Zumkeller_, May 15 2002