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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A063538 Not sqrt(n-1)-smooth numbers: largest prime factor of n (A006530) >= sqrt(n). 5
2, 3, 4, 5, 6, 7, 9, 10, 11, 13, 14, 15, 17, 19, 20, 21, 22, 23, 25, 26, 28, 29, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 46, 47, 49, 51, 52, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 68, 69, 71, 73, 74, 76, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

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

LINKS

Table of n, a(n) for n=1..65.

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

CROSSREFS

Cf. A006530, A063762. Complement of A063539. Supersequence of A001358 (semiprimes).

Sequence in context: A131511 A210490 A166155 * A167207 A037143 A236105

Adjacent sequences:  A063535 A063536 A063537 * A063539 A063540 A063541

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, 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 December 18 20:17 EST 2014. Contains 252174 sequences.