|
|
A135058
|
|
Least m such that both m and m+n have exactly n distinct prime divisors, ignoring multiplicity.
|
|
2
|
|
|
1, 2, 10, 102, 1326, 96135, 607614, 159282123, 9617162170, 1110180535035, 28334309296920, 16513791577659519, 271518698440871310
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Note that here the m and m+n may be divisible by squares (compare A097978).
a(13) <= 592357638037885411965.
If we change "exactly n" to "at least n", the sequence is still the same at least through a(12).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(2) = 10 because 10=2*5 and 12=3*2^2 have two distinct prime factors.
a(3) = 102 because 102=2*3*17 and 105=3*5*7 each have three distinct prime factors.
a(5) = 96135 because 96135 = 3*5*13*17*29 and 96140 = 2^2*5*11*19*23 each have 5 distinct prime factors.
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|