

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




OFFSET

0,1


COMMENTS

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.


REFERENCES

Richard K. Guy, Unsolved Problems in Number Theory, New York: SpringerVerlag, 2004, pp. 268271.


LINKS

Table of n, a(n) for n=0..4.
Henri Darmon and Loic Merel, Winding quotients and some variants of Fermatâ€™s Last Theorem
Arkadiusz Wesolowski, Examples of these magic squares
Wikipedia, Fermat's Last Theorem
Index entries for sequences related to magic squares


CROSSREFS

Cf. A269231.
Sequence in context: A317106 A033347 A173896 * A169733 A105325 A277270
Adjacent sequences: A271447 A271448 A271449 * A271451 A271452 A271453


KEYWORD

nonn,fini,hard,more


AUTHOR

Arkadiusz Wesolowski, Apr 14 2016


STATUS

approved



