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.

A287165 Smallest number with exactly n representations as a sum of 6 nonzero squares or 0 if no such number exists.

Original entry on oeis.org

6, 21, 30, 36, 63, 54, 60, 87, 78, 81, 84, 111, 102, 117, 108, 116, 126, 129, 134, 137, 132, 150, 172, 165, 161, 156, 177, 164, 195, 191, 182, 213, 180, 188, 198, 0, 204, 206, 215, 222, 243, 212, 251, 262, 233, 230
Offset: 1

Views

Author

Ilya Gutkovskiy, May 20 2017

Keywords

Examples

			a(1) = 6 because 6 is the smallest number with exactly 1 representation as a sum of 6 nonzero squares: 6 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 1^2;
a(2) = 21 because 21 is the smallest number with exactly 2 representations as a sum of 6 nonzero squares: 21 = 1^2 + 1^2 + 1^2 + 1^2 + 1^2 + 4^2 = 1^2 + 2^2 + 2^2 + 2^2 + 2^2 + 2^2, etc.
		

Crossrefs

Formula

A025430(a(n)) = n for a(n) > 0.