a(n) is the smallest positive integer k such that the Diophantine equation x^3 + y^3 + z^3 = k^2, where 0 < x < y < z has exactly n integer solutions.
A385354
a(n) is the smallest positive integer k such that the Diophantine equation x^3 + y^3 + z^3 = k^2, where 0 < x < y < z has exactly n integer solutions.
Terms
- a(0) =6a(1) =188a(2) =768a(3) =1728a(4) =2640a(5) =21120a(6) =42336a(7) =13824a(8) =71280a(9) =5832a(10) =80352a(11) =74088a(12) =425088a(13) =421875a(14) =1058400a(15) =110592a(16) =287496a(17) =46656
External references
- oeis: A385354