

A290401


Smallest prime p such that the Diophantine equation x + y + z = p with x*y*z = k^3 (0 < x <= y <= z) has exactly n solutions.


0



3, 31, 47, 127, 137, 211, 271, 257, 397, 631, 661, 1039, 1879, 1471, 2203, 2707, 2179, 1321, 3169, 3319, 6247, 4507, 5569, 6871, 6481, 6121, 6271, 9521, 9421, 13441, 8677, 17029, 8539, 15349, 11971, 25171, 21139, 17851, 29761, 21031, 33769, 37591, 28429, 44987
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


LINKS



EXAMPLE

a(3) = 47 because the corresponding equation has exactly three solutions: (2, 20, 25), (4, 16, 27) and (6, 9, 32), and there is no prime smaller than 47 for which this is the case.


CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



