The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071191 Least m>n such that the number of prime factors of m and n differ at most by 1. 3

%I #11 Feb 23 2024 15:29:42

%S 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 27,28,30,31,33,33,36,34,35,37,40,38,39,41,42,43,44,46,45,46,47,49,54,

%U 50,51,52,54,55,56,57,60,58,59,61,63,62,63,65

%N Least m>n such that the number of prime factors of m and n differ at most by 1.

%C abs(A001222(a(n)) - A001222(n)) <= 1.

%H David A. Corneth, <a href="/A071191/b071191.txt">Table of n, a(n) for n = 1..10000</a>

%e 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 (PARI)

%o a(n) = {

%o my(b = bigomega(n));

%o for(i = n + 1, oo,

%o if(abs(bigomega(i)-b) <= 1,

%o return(i)

%o )

%o )

%o } \\ _David A. Corneth_, Feb 23 2024

%Y Cf. A071192, A071193.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, May 15 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 10:02 EDT 2024. Contains 373105 sequences. (Running on oeis4.)