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.

Showing 1-3 of 3 results.

A374693 a(n) is the smallest number which can be represented as the sum of 3 distinct nonzero fourth powers in exactly n ways, or -1 if no such number exists.

Original entry on oeis.org

98, 6578, 811538, 5978882, 1289202642, 292965218, 779888018, 5745705602, 105760443698, 49511121842, 1872511131218, 281539574498, 17673688436978
Offset: 1

Views

Author

Ilya Gutkovskiy, Jul 17 2024

Keywords

Comments

a(16) = 7865870969138. - Michael S. Branicky, Jul 23 2024

Examples

			a(2) = 6578 = 1^4 + 2^4 + 9^4 = 3^4 + 7^4 + 8^4.
a(3) = 811538 = 4^4 + 23^4 + 27^4 = 7^4 + 21^4 + 28^4 = 12^4 + 17^4 + 29^4.
		

Crossrefs

Extensions

a(9)-a(12) from Michael S. Branicky, Jul 22 2024
a(13) from Michael S. Branicky, Jul 23 2024

A374803 a(n) is the smallest number which can be represented as the sum of 4 distinct positive fifth powers in exactly n ways, or -1 if no such number exists.

Original entry on oeis.org

1300, 4062500, 1479604544
Offset: 1

Views

Author

Ilya Gutkovskiy, Jul 20 2024

Keywords

Examples

			a(2) = 4062500 = 1^5 + 14^5 + 16^5 + 19^5 = 5^5 + 10^5 + 15^5 + 20^5.
a(3) = 1479604544 = 3^5 + 48^5 + 52^5 + 61^5 = 13^5 + 36^5 + 51^5 + 64^5 = 18^5 + 36^5 + 44^5 + 66^5.
		

Crossrefs

A374804 a(n) is the smallest number which can be represented as the sum of 4 distinct nonzero sixth powers in exactly n ways, or -1 if no such number exists.

Original entry on oeis.org

4890, 160426515, 1885800643779
Offset: 1

Views

Author

Ilya Gutkovskiy, Jul 20 2024

Keywords

Examples

			a(2) = 160426515 = 1^6 + 3^6 + 19^6 + 22^6 = 1^6 + 10^6 + 15^6 + 23^6.
a(3) = 1885800643779 = 1^6 + 34^6 + 49^6 + 111^6 = 7^6 + 43^6 + 69^6 + 110^6 = 18^6 + 25^6 + 77^6 + 109^6.
		

Crossrefs

Showing 1-3 of 3 results.