

A075044


a(0) = 1; a(n) = the smallest number k such that n numbers from k to k+n1 have n distinct prime divisors, or 0 if no such number exists.


2




OFFSET

0,2


LINKS

Table of n, a(n) for n=0..6.


MATHEMATICA

Do[k = 1; While[Length /@ FactorInteger /@ Range[k, k+n1] != Table[n, {n}], k++ ]; Print[k], {n, 0, 5}] (* Ryan Propper, Oct 01 2005 *)


CROSSREFS

Cf. A006049, A045983, A006073.
Sequence in context: A294353 A156172 A013036 * A211891 A060599 A319774
Adjacent sequences: A075041 A075042 A075043 * A075045 A075046 A075047


KEYWORD

nonn


AUTHOR

Amarnath Murthy, Sep 03 2002


EXTENSIONS

Corrected and extended by Ryan Propper, Oct 01 2005
Offset corrected and a(6) from Donovan Johnson, Aug 03 2009


STATUS

approved



