|
Search: id:A068007
|
|
|
| A068007 |
|
Least number k such that the number of primes of the form [k/j] for j=1..k (A067514) is n, or zero if impossible. |
|
+0 1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
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. A067514.
Adjacent sequences: A068004 A068005 A068006 this_sequence A068008 A068009 A068010
Sequence in context: A112730 A049842 A018636 this_sequence A033094 A081032 A082845
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 12 2002
|
|
|
Search completed in 0.002 seconds
|