Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #21 Nov 19 2024 15:04:30
%S 6,18,54,87,108,216,174,348,396,324,696,864,492,1080,984,1728,1584,
%T 1296,2160,1440,3312,3132,2880,2592,4176,4230,6624,3960,5184,6264,
%U 4320,5760,6480,7200,10200,7920,9936,5940,8640,12060,11520,9900,14256,14400,16560,14760,15660,22140
%N 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.
%C All the terms seem to be multiple of 3.
%H Zhining Yang, <a href="/A377444/b377444.txt">Table of n, a(n) for n = 1..66</a>
%e a(2)=18, because 18^3 = 9^3 + 12^3 + 15^3 = 2^3 + 12^3 + 16^3 and no integer less than 18 has 2 solutions.
%t a = Table[SelectFirst[Table[{k, Length@Select[PowersRepresentations[k^3, 3, 3], #[[1]] > 0 &]}, {k, 3, 500, 3}], #[[2]] == k &], {k, 10}]
%o (Python)
%o from itertools import count
%o from sympy.solvers.diophantine.diophantine import power_representation
%o def A377444(n): return next(filter(lambda k:len(list(power_representation(k**3,3,3)))==n,count(1))) # _Chai Wah Wu_, Nov 19 2024
%Y Cf. A316359.
%K nonn,easy
%O 1,1
%A _Zhining Yang_, Oct 28 2024