OFFSET
0,2
COMMENTS
a(n) is the least k such that there are exactly n primes of the form j*(k-j)+k, 1 <= j < k.
Does such a number k always exist?
LINKS
Robert Israel, Table of n, a(n) for n = 0..1000
EXAMPLE
a(4) = 15 because 15 is the least k for which A355784(k) = 4.
MAPLE
V:= Array(0..100):
count:= 0:
for k from 1 while count < 101 do
v:= f(k);
if v > 100 then next fi;
if V[v] = 0 then V[v]:= k; count:= count+1 fi
od:
convert(V, list);
CROSSREFS
Cf. A355784.
KEYWORD
nonn
AUTHOR
J. M. Bergot and Robert Israel, Jul 16 2022
STATUS
approved