a(n) is the smallest integer k such that the Diophantine equation x^3 + y^3 + z^3 = k^3, where 0 < x <= y <= z has exactly n integer solutions.
A377444
a(n) is the smallest integer k such that the Diophantine equation x^3 + y^3 + z^3 = k^3, where 0 < x <= y <= z has exactly n integer solutions.
Terms
- a(0) =6a(1) =18a(2) =54a(3) =87a(4) =108a(5) =216a(6) =174a(7) =348a(8) =396a(9) =324a(10) =696a(11) =864a(12) =492a(13) =1080a(14) =984a(15) =1728a(16) =1584a(17) =1296a(18) =2160a(19) =1440a(20) =3312a(21) =3132a(22) =2880a(23) =2592a(24) =4176a(25) =4230a(26) =6624a(27) =3960a(28) =5184a(29) =6264
External references
- oeis: A377444