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.

A097759 Number of integers that can be written as a sum of distinct squares in exactly n ways.

Original entry on oeis.org

31, 38, 25, 30, 19, 14, 13, 10, 17, 15, 6, 11, 7, 6, 10, 5, 8, 6, 8, 5, 7, 6, 1, 4, 4, 10, 3, 7, 7, 3, 4, 5, 3, 6, 5, 2, 5, 3, 2, 1, 2, 8, 1, 3, 5, 1, 4, 1, 4, 2, 4, 7, 2, 2, 2, 4, 1, 1, 5, 1, 2, 2, 5, 2, 3, 2, 2, 2, 0, 1, 5, 2, 3, 1, 1, 1, 2, 2, 6, 1, 4, 0, 2, 1, 3, 1, 3, 4, 0, 2, 4, 5, 1, 1, 1, 0, 2, 1
Offset: 0

Views

Author

Ray Chandler, Sep 06 2004

Keywords

Comments

Number of terms in row n of table described in A097757.

Crossrefs