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.
%I A264764 #9 Nov 26 2015 08:52:45 %S A264764 1,0,422481,144 %N A264764 a(n) = smallest positive k such that k^n is the sum of n-1 positive n-th powers, or 0 if no solution exists. %C A264764 a(3) = 0 (as is the case under Fermat's last theorem). %C A264764 Is the number of zero terms finite? %H A264764 Wikipedia, <a href="https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem">Fermat's Last Theorem</a> %H A264764 Wikipedia, <a href="https://en.wikipedia.org/wiki/Lander,_Parkin,_and_Selfridge_conjecture">Lander, Parkin, and Selfridge conjecture</a> %e A264764 1^2 = 1^2. %e A264764 414560^4 + 217519^4 + 95800^4 = 422481^4. %e A264764 27^5 + 84^5 + 110^5 + 133^5 = 144^5. %Y A264764 Cf. A003828. %K A264764 nonn,hard,more %O A264764 2,3 %A A264764 _Arkadiusz Wesolowski_, Nov 23 2015