%I A063762
%S A063762 4,6,9,10,14,15,20,21,22,25,26,28,33,34,35,38,39,42,44,46,49,51,52,55,
%T A063762 57,58,62,65,66,68,69,74,76,77,78,82,85,86,87,88,91,92,93,94,95,99,102,
%U A063762 104,106,110,111,114,115,116,117,118,119,121,122,123,124,129,130,133
%N A063762 Sqrt(n)-rough nonprimes: largest prime factor of n (A006530) >= sqrt(n).
%C A063762 A positive integer is called y-rough if all its prime factors are >= 
               y.
%D A063762 D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms; 
               see pp. 95-98.
%H A063762 Harry J. Smith, <a href="b063762.txt">Table of n, a(n) for n=1,...,1000</
               a>
%H A063762 Beeler, M., Gosper, R. W. and Schroeppel, R., <a href="http://www.inwap.com/
               pdp10/hbaker/hakmem/number.html#item29">HAKMEM, ITEM 29</a>
%t A063762 Select[ Range[ 2, 150 ], !PrimeQ[ # ] && FactorInteger[ # ] [ [ -1, 1 
               ] ] >= Sqrt[ # ] & ]
%o A063762 (PARI) { n=0; for (m=2, 10^9, f=vecmax(component(factor(m), 1)); if(!isprime(m) 
               && f^2 >= m, write("b063762.txt", n++, " ", m); if (n==1000, break)) 
               ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 30 2009]
%Y A063762 Cf. A063538, A063539, A063763.
%Y A063762 Sequence in context: A010428 A028260 A085155 this_sequence A001358 A108764 
               A129336
%Y A063762 Adjacent sequences: A063759 A063760 A063761 this_sequence A063763 A063764 
               A063765
%K A063762 nonn
%O A063762 1,1
%A A063762 Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 14 2001