login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A271450 a(n) = smallest magic sum of any 3 X 3 magic square which contains exactly n cubes, or 0 if no such magic square exists. 1

%I #24 Apr 15 2016 13:58:49

%S 27,18,15,42,882

%N a(n) = smallest magic sum of any 3 X 3 magic square which contains exactly n cubes, or 0 if no such magic square exists.

%C For n >= 7, a(n) = 0 because the equation x^n + y^n = 2*z^n has no solution for n > 2 apart from the trivial x = y = z.

%D Richard K. Guy, Unsolved Problems in Number Theory, New York: Springer-Verlag, 2004, pp. 268-271.

%H Henri Darmon and Loic Merel, <a href="http://www.math.mcgill.ca/darmon/pub/Articles/Research/18.Merel/paper.pdf">Winding quotients and some variants of Fermat’s Last Theorem</a>

%H Arkadiusz Wesolowski, <a href="/A271450/a271450.txt">Examples of these magic squares</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem">Fermat's Last Theorem</a>

%H <a href="/index/Mag#magic">Index entries for sequences related to magic squares</a>

%Y Cf. A269231.

%K nonn,fini,hard,more

%O 0,1

%A _Arkadiusz Wesolowski_, Apr 14 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)