login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063762 Sqrt(n)-rough nonprimes: largest prime factor of n (A006530) >= sqrt(n). 4
4, 6, 9, 10, 14, 15, 20, 21, 22, 25, 26, 28, 33, 34, 35, 38, 39, 42, 44, 46, 49, 51, 52, 55, 57, 58, 62, 65, 66, 68, 69, 74, 76, 77, 78, 82, 85, 86, 87, 88, 91, 92, 93, 94, 95, 99, 102, 104, 106, 110, 111, 114, 115, 116, 117, 118, 119, 121, 122, 123, 124, 129, 130, 133 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A positive integer is called y-rough if all its prime factors are >= y.

REFERENCES

D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms; see pp. 95-98.

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

Beeler, M., Gosper, R. W. and Schroeppel, R., HAKMEM, ITEM 29

MATHEMATICA

Select[ Range[ 2, 150 ], !PrimeQ[ # ] && FactorInteger[ # ] [ [ -1, 1 ] ] >= Sqrt[ # ] & ]

PROG

(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, Aug 30 2009]

CROSSREFS

Cf. A063538, A063539, A063763.

Sequence in context: A028260 A085155 A219786 * A240938 A001358 A176540

Adjacent sequences:  A063759 A063760 A063761 * A063763 A063764 A063765

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Aug 14 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 16 13:41 EDT 2014. Contains 246817 sequences.