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.

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.

Original entry on oeis.org

1, 0, 422481, 144
Offset: 2

Views

Author

Arkadiusz Wesolowski, Nov 23 2015

Keywords

Comments

a(3) = 0 (as is the case under Fermat's last theorem).
Is the number of zero terms finite?

Examples

			1^2 = 1^2.
414560^4 + 217519^4 + 95800^4 = 422481^4.
27^5 + 84^5 + 110^5 + 133^5 = 144^5.
		

Crossrefs

Cf. A003828.