login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A079892
Least number > n having one more distinct prime factor than n.
5
2, 6, 6, 6, 6, 30, 10, 10, 10, 30, 12, 30, 14, 30, 30, 18, 18, 30, 20, 30, 30, 30, 24, 30, 26, 30, 28, 30, 33, 210, 33, 33, 42, 42, 42, 42, 38, 42, 42, 42, 44, 210, 44, 60, 60, 60, 48, 60, 50, 60, 60, 60, 54, 60, 60, 60, 60, 60, 62, 210, 62, 66, 66, 65, 66, 210, 68, 70, 70, 210
OFFSET
1,1
COMMENTS
A001221(a(n)) = A001221(n) + 1;
a(A002110(k)) = A002110(k+1).
LINKS
PROG
(Haskell)
a079892 n = head [x | x <- [n + 1 ..], a001221 x == 1 + a001221 n]
-- Reinhard Zumkeller, Aug 29 2013
CROSSREFS
Cf. A165713.
Sequence in context: A294961 A048765 A103643 * A096014 A071888 A117217
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jan 14 2003
STATUS
approved