(Translated by https://www.hiragana.jp/)
# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a135058 Showing 1-1 of 1 %I A135058 #15 Mar 06 2017 19:46:34 %S A135058 1,2,10,102,1326,96135,607614,159282123,9617162170,1110180535035, %T A135058 28334309296920,16513791577659519,271518698440871310 %N A135058 Least m such that both m and m+n have exactly n distinct prime divisors, ignoring multiplicity. %C A135058 Note that here the m and m+n may be divisible by squares (compare A097978). %C A135058 a(13) <= 592357638037885411965. %C A135058 If we change "exactly n" to "at least n", the sequence is still the same at least through a(12). %F A135058 a(n) = min{m: A001221(m) = A001221(m+n) = n}. - _R. J. Mathar_, Mar 01 2017 %e A135058 a(2) = 10 because 10=2*5 and 12=3*2^2 have two distinct prime factors. %e A135058 a(3) = 102 because 102=2*3*17 and 105=3*5*7 each have three distinct prime factors. %e A135058 a(5) = 96135 because 96135 = 3*5*13*17*29 and 96140 = 2^2*5*11*19*23 each have 5 distinct prime factors. %Y A135058 Cf. A097978, A098515. %K A135058 hard,nonn,more %O A135058 0,2 %A A135058 _David Wasserman_, Feb 11 2008 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE