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.

A350241 a(n) is the smallest number which can be represented as the sum of n distinct nonzero squares in exactly n ways, or 0 if no such number exists.

Original entry on oeis.org

1, 65, 101, 142, 175, 255, 316, 380, 501, 625, 794, 995, 1155, 1456, 1696, 2012, 2373, 2709, 3118, 3566, 4158, 4608, 5211, 5852, 6500, 7221, 8065, 8906, 9766, 11089, 11855, 12868, 14020, 15337, 16601, 17854, 19255, 20840, 22364, 23964, 25813, 27665, 29650, 31635
Offset: 1

Views

Author

Ilya Gutkovskiy, Dec 21 2021

Keywords

Examples

			For n = 2: 65 = 1^2 + 8^2 = 4^2 + 7^2.
For n = 3: 101 = 1^2 + 6^2 + 8^2 = 2^2 + 4^2 + 9^2 = 4^2 + 6^2 + 7^2.
		

Crossrefs

Extensions

More terms from Jinyuan Wang, Dec 21 2021