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.

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.

Terms

    a(0) =3a(1) =31a(2) =47a(3) =127a(4) =137a(5) =211a(6) =271a(7) =257a(8) =397a(9) =631a(10) =661a(11) =1039a(12) =1879a(13) =1471a(14) =2203a(15) =2707a(16) =2179a(17) =1321a(18) =3169a(19) =3319a(20) =6247a(21) =4507a(22) =5569a(23) =6871a(24) =6481a(25) =6121a(26) =6271a(27) =9521a(28) =9421a(29) =13441

External references