login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Least number > n having one more distinct prime factor than n.
5

%I #6 Aug 31 2013 16:59:15

%S 2,6,6,6,6,30,10,10,10,30,12,30,14,30,30,18,18,30,20,30,30,30,24,30,

%T 26,30,28,30,33,210,33,33,42,42,42,42,38,42,42,42,44,210,44,60,60,60,

%U 48,60,50,60,60,60,54,60,60,60,60,60,62,210,62,66,66,65,66,210,68,70,70,210

%N Least number > n having one more distinct prime factor than n.

%C A001221(a(n)) = A001221(n) + 1;

%C a(A002110(k)) = A002110(k+1).

%H Reinhard Zumkeller, <a href="/A079892/b079892.txt">Table of n, a(n) for n = 1..10000</a>

%o (Haskell)

%o a079892 n = head [x | x <- [n + 1 ..], a001221 x == 1 + a001221 n]

%o -- _Reinhard Zumkeller_, Aug 29 2013

%Y Cf. A079893, A079890.

%Y Cf. A165713.

%K nonn

%O 1,1

%A _Reinhard Zumkeller_, Jan 14 2003