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.

A295157 Numbers that have exactly nine representations as a sum of five nonnegative squares.

Original entry on oeis.org

61, 67, 68, 70, 75, 76, 84, 88, 89, 92, 120
Offset: 1

Views

Author

Robert Price, Nov 15 2017

Keywords

Comments

This sequence is finite and complete. See the von Eitzen Link. For positive integer n, if n > 6501 then the number of ways to write n as a sum of 5 squares is at least 10. So for n > 6501, there are more than eight ways to write n as a sum of 5 squares. For n <= 6501, it has been verified if n is in the sequence by inspection. Hence the sequence is complete.

References

  • E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, New York, 1985, p. 86, Theorem 1.

Crossrefs