login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A067289
Numbers k such that the number of divisors of k is floor(prime(k)/k).
1
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
OFFSET
1,1
LINKS
FORMULA
Numbers k such that A000005(k) = floor(prime(k)/k).
MATHEMATICA
Select[Range[1000], DivisorSigma[0, #] == Floor[Prime[#]/#] &] (* Amiram Eldar, Apr 23 2022 *)
CROSSREFS
Sequence in context: A339096 A249735 A218394 * A036491 A036490 A106330
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 24 2002
STATUS
approved