The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067289 Numbers n such that the number of divisors of n is floor(prime(n)/n). 0
 5, 7, 11, 25, 33, 34, 35, 38, 39, 46, 51, 55, 57, 58, 62, 65, 81, 207, 212, 236, 242, 243, 244, 245, 261, 268, 275, 279, 284, 292, 316, 325, 332, 333, 338, 356, 363, 369, 387, 388, 404, 412, 423, 425, 428, 436, 729, 1065, 1066, 1070, 1074, 1085, 1086, 1090 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA n such that A000005(n)=floor(prime(n)/n) CROSSREFS Cf. A000005. Sequence in context: A339096 A249735 A218394 * A036491 A036490 A106330 Adjacent sequences:  A067286 A067287 A067288 * A067290 A067291 A067292 KEYWORD nonn AUTHOR Benoit Cloitre, Feb 24 2002 STATUS approved

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

Last modified December 2 05:23 EST 2020. Contains 338865 sequences. (Running on oeis4.)