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”).

A068007
Least number k such that the number of primes of the form [k/j] for j=1..k (A068050) is n, or zero if impossible.
0
1, 2, 5, 7, 10, 11, 15, 21, 0, 22, 23, 31, 34, 38, 35, 45, 50, 46, 47, 53, 62, 58, 59, 67, 69, 84, 70, 71, 79, 83, 87, 92, 93, 101, 94, 105, 95, 106, 107, 116, 117, 122, 118, 125, 119, 134, 135, 139, 146, 142, 149, 143, 156, 155, 158, 159, 171, 166, 167, 176, 175, 185
OFFSET
0,2
COMMENTS
a(n) = 0 for n = 8, 94, 103, 122, 180, 283, 311, 353, 355, 398, ...
MATHEMATICA
f[n_] := Count[ PrimeQ[ Floor[ n/Table[i, {i, Floor[n/2]} ]]], True]; a = Table[0, {100} ]; Do[b = f[n]; If[b < 100 && a[[b + 1]] == 0, a[[b + 1]] = n], {n, 1, 300}]; a
CROSSREFS
Cf. A068050.
Sequence in context: A288602 A049842 A018636 * A224870 A033094 A206522
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Feb 12 2002
EXTENSIONS
Name corrected by Sean A. Irvine, Jan 18 2024
STATUS
approved