%I A008365
%S A008365 1,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,
%T A008365 103,107,109,113,127,131,137,139,149,151,157,163,167,169,173,179,181,
%U A008365 191,193,197,199,211,221,223,227,229,233,239,241,247,251,257,263,269
%N A008365 Smallest prime factor is >= 13.
%C A008365 Also the 13-rough numbers: positive integers that have no prime factors 
               less than 13 [From Michael Porter (michael_b_porter(AT)yahoo.com), 
               Oct 10 2009]
%H A008365 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               RoughNumber.html">Rough Number</a> From MathWorld--A Wolfram Web 
               Resource. [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 
               10 2009]
%H A008365 <a href="Sindx_Sk.html#smooth">Index entries for sequences related to 
               smooth numbers</a> [From Michael Porter (michael_b_porter(AT)yahoo.com), 
               Oct 10 2009]
%p A008365 for i from 1 to 500 do if gcd(i,2310) = 1 then print(i); fi; od;
%t A008365 Select[ Range[ 300 ], GCD[ #1, 2310 ]==1& ]
%o A008365 (PARI) isA008365(n) = gcd(n,2310)==1 [From Michael Porter (michael_b_porter(AT)yahoo.com), 
               Oct 10 2009]
%Y A008365 For k-rough numbers with other values of k, see A000027 A005408 A007310 
               A007775 A008364 A008365 A008366 A166061 A166063 [From Michael Porter 
               (michael_b_porter(AT)yahoo.com), Oct 10 2009]
%Y A008365 Sequence in context: A052055 A075761 A046064 this_sequence A132077 A034845 
               A045921
%Y A008365 Adjacent sequences: A008362 A008363 A008364 this_sequence A008366 A008367 
               A008368
%K A008365 nonn
%O A008365 1,2
%A A008365 N. J. A. Sloane (njas(AT)research.att.com).