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.

A226757 a(n) = number of distinct quadruples of squares modulo n.

Original entry on oeis.org

1, 16, 16, 16, 81, 256, 256, 81, 256, 1296, 1296, 256, 2401, 4096, 1296, 256, 6561, 4096, 10000, 1296, 4096, 20736, 20736, 1296, 14641, 38416, 14641, 4096, 50625, 20736, 65536, 2401, 20736, 104976, 20736, 4096, 130321, 160000, 38416, 6561, 194481, 65536
Offset: 1

Views

Author

Keywords

Crossrefs

Formula

a(n) = A000224(n)^4. - Andrew Howroyd, Aug 06 2018

Extensions

Name corrected by Andrew Howroyd, Aug 06 2018