The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A180323 Positive numbers l of the form l = A007913(k^4 - 4*k*m^3), where 1 <= k <= 5*l, 1 <= |m| <= 5*l. 1

%I

%S 2,5,6,11,15,17,29,33,41,42,43,51,53,58,62,65,69,82,85,86,89,93

%N Positive numbers l of the form l = A007913(k^4 - 4*k*m^3), where 1 <= k <= 5*l, 1 <= |m| <= 5*l.

%C The equation x^3 + y^3 + z^3 = 0 is solvable in numbers of the form N + M*sqrt(a(n)), where M and N are integers. Moreover, it is solvable in numbers of the form N + M*sqrt(l), where l has the form l = A007913(k^4 - 4*k*m^3), where k,|m| >= 1 (without restrictions k,|m| <= 5*l). But in this more general case there could be unknown numbers l having this form; this circumstance does not allow construction of the full sequence of such l. Therefore we restrict ourselves by the condition k,|m| <= 5*l. Note that testing l with respect to this condition is rather simple by sorting all values of k,|m| <= l. One can prove that, at least, if the Fermat numbers (A000215) are squarefree, then the sequence is infinite. Conjecture (necessity of the form of l): If the equation x^3 + y^3 + z^3 = 0 is solvable in numbers of the form N + M*sqrt(l) with integer N,M, then there exist positive integers k,m such that l = A007913(k^4 - 4*k*m^3).

%F Let a(n) = A007913(k^4-4*k*m^3). Put g=sqrt(A008833(k^4-4*k*m^3)). Then identity A^3+B^3+C^3=0 is valid, where A=2*m^6-k^3*m^3-k^6+k*(k^3+5*m^3)*g*sqrt(a(n)); B=3*m*(k^3-m^3)*(k^2-g*sqrt(a(n))); C=k^6-8*k^3*m^3-2*m^6-k*(k^3-4*m^3)*g*sqrt(a(n)).

%Y Cf. A007913, A008833, A000215.

%K nonn,uned,more

%O 1,1

%A _Vladimir Shevelev_, Aug 28 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 10 06:54 EDT 2021. Contains 342843 sequences. (Running on oeis4.)