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.

A230563 Smallest number that is the sum of three positive n-th powers in at least two ways.

Original entry on oeis.org

5, 27, 251, 2673, 1375298099, 160426514
Offset: 1

Views

Author

Jonathan Sondow, Oct 25 2013

Keywords

Comments

a(7) > 10^26 (if it exists). - Donovan Johnson, Nov 22 2013
a(7) > 33055^7 ~ 4.31*10^31 (if it exists). Duncan Moore, Oct 07 2017

Examples

			5 = 1^1 + 1^1 + 3^1 = 1^1 + 2^1 + 2^1.
27 = 1^2 + 1^2 + 5^2 = 3^2 + 3^2 + 3^2.
251 = 1^3 + 5^3 + 5^3 = 2^3 + 3^3 + 6^3.
2673 = 2^4 + 4^4 + 7^4 = 3^4 + 6^4 + 6^4.
1375298099 = 3^5 + 54^5 + 62^5 = 24^5 + 28^5 + 67^5.
160426514 = 3^6 + 19^6 + 22^6 = 10^6 + 15^6 + 23^6.
		

References

  • G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, section 21.11.

Crossrefs

Extensions

a(4) and a(5) corrected by Donovan Johnson, Oct 28 2013
Edited by N. J. A. Sloane, Apr 03 2021