cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A271450 #24 Apr 15 2016 13:58:49
%S A271450 27,18,15,42,882
%N 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.
%C A271450 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 A271450 Richard K. Guy, Unsolved Problems in Number Theory, New York: Springer-Verlag, 2004, pp. 268-271.
%H A271450 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 A271450 Arkadiusz Wesolowski, <a href="/A271450/a271450.txt">Examples of these magic squares</a>
%H A271450 Wikipedia, <a href="http://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem">Fermat's Last Theorem</a>
%H A271450 <a href="/index/Mag#magic">Index entries for sequences related to magic squares</a>
%Y A271450 Cf. A269231.
%K A271450 nonn,fini,hard,more
%O A271450 0,1
%A A271450 _Arkadiusz Wesolowski_, Apr 14 2016