login
A392549
a(n) is the least positive integer k such that Mordell's equation y^2 = x^3 + k^2 has exactly n integer solutions with y >= 0.
1
2, 11, 1, 6, 3, 10, 80, 62, 63, 210, 55, 840, 15, 440, 120, 960, 3240, 561, 2415, 510, 665, 19320, 1155, 5320, 148785, 31185, 9240, 665000, 73920, 143640, 249480, 379610, 54285
OFFSET
1,1
COMMENTS
a(34) > 10^6 if it exists, a(37) = 255255, a(38) = 434280, a(42) = 794310, a(64) = 451605.
EXAMPLE
a(6) = 10 because 10 is the least k such that y^2 = x^3 + k^2 has 6 integral solutions with nonnegative y: {{-4, 6}, {0, 10}, {5, 15}, {20, 90}, {24, 118}, {2660, 137190}}.
MATHEMATICA
f[k_]:=(m=Range[0, 71];
xmax=50000; (* This xmax only gives correct results up to n = 12, as n=13 has a larger solution {720114, 611085363} requiring a larger xmax *)
m72k=Intersection[Union[Mod[m^2-k^2, 72]], Union[Mod[m^3, 72]]];
s=Select[Range[-Floor[k^(2/3)], xmax], MemberQ[m72k, Mod[#^3, 72]]&]; t=Select[s, IntegerQ[Sqrt[#^3+k^2]]&]; {k, Length@t}); v=Table[f[k], {k, 100}];
a=Table[SelectFirst[v, #[[2]]==n&], {n, 9}][[All, 1]]
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Zhining Yang, Jan 15 2026
STATUS
approved