|
|
A075044
|
|
a(0) = 1; a(n) = the smallest number k such that n numbers from k to k+n-1 have n distinct prime divisors, or 0 if no such number exists.
|
|
2
|
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
MATHEMATICA
|
Do[k = 1; While[Length /@ FactorInteger /@ Range[k, k+n-1] != Table[n, {n}], k++ ]; Print[k], {n, 0, 5}] (* Ryan Propper, Oct 01 2005 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|