Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063762
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063762 Sqrt(n)-rough nonprimes: largest prime factor of n (A006530) >= sqrt(n). +0
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; listen)
OFFSET

1,1

COMMENT

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

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

MATHEMATICA

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

CROSSREFS

Cf. A063538, A063539, A063763.

Sequence in context: A010428 A028260 A085155 this_sequence A001358 A108764 A129336

Adjacent sequences: A063759 A063760 A063761 this_sequence A063763 A063764 A063765

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 14 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research