A384100 a(n) is the least positive x such that x^3 + x + n^2 is a perfect square, or 0 if no such x exists.
0, 72, 4128, 8, 262272, 1000200, 44, 7529928, 16777728, 34012872, 64000800, 113380872, 191104128, 308917128, 12, 729001800, 4, 1544806728, 32, 3010939272, 4096003200, 8, 7256317728, 9474301128, 80, 15625005000, 19770615072, 24794917128, 30840985728, 38068699272
Offset: 0
Keywords
Examples
For n = 0, there can't be any positive x for which x^3 + x = x*(x^2 + 1) = y^2, therefore a(0) = 0. (Indeed, x^2 + 1 == 1 (mod x), so x has no factor in common with x^2 + 1 = y^2/x, so x must be a square itself, x = m^2. But then, x^2 + 1 = (y/m)^2 can't have a solution, since x^2 + 1 can't be a square.) For n = 1, we can check that for x = 1, 2, 3, ..., value of x^3 + x + 1 = 3, 10, 31, ... isn't a square for any x < 72 which is the least positive integer so that x^3 + x + 1 = 72*(72^2 + 1) + 1 = 373321 = (13*47)^2 is a perfect square, thus a(1) = 72. For n = 2, there is no x < 4128 for which x^3 + x + 2^2 is a square, but 4128*(4128^2+1) + 4 = (2*132611)^2 is indeed the least square of that form, so a(2) = 4128. (As for n = 1, this is the upper limit for a(n), given in FORMULA.) For n = 3, there is a(3) = x = 8 for which x^3 + x + 3^2 = 529 = 23^2 is a square, much smaller than the upper limit for a(n).
Links
- Rik Bos, How do I show that x^3 + x + a^2 = y^2 has at least one pair of positive integer solution (x, y) for each positive integer a? (Answer), Quora, May 12, 2025.
Crossrefs
Cf. A384101 (the corresponding y-values).
Programs
-
PARI
apply({A384100(n)=for(x=1, 64*n^6+8*n^2, issquare(n^2+x^3+x) && return(x))}, [0..6])
Formula
a(n) <= 8*n^2*(8*n^4 + 1) for all n > 0.
Extensions
More terms from Jinyuan Wang, May 26 2025
Comments