|
%I #12 Sep 13 2015 09:43:53
%S 1,2,14,644,134043,129963314,626804494291
%N 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.
%t 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 *)
%Y Cf. A006049, A045983, A006073.
%K nonn
%O 0,2
%A _Amarnath Murthy_, Sep 03 2002
%E Corrected and extended by _Ryan Propper_, Oct 01 2005
%E Offset corrected and a(6) from _Donovan Johnson_, Aug 03 2009
|
