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.

A317244 For n >= 3, smallest prime number N such that for every prime p >= N, every element in Z_p can be expressed as a sum of two n-gonal numbers mod p, without allowing zero as a summand.

Original entry on oeis.org

11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 11, 11, 11, 11, 11, 11, 11, 23, 11, 11, 13, 29, 11, 11, 11, 11, 11, 11, 11, 37, 11, 13, 11, 11, 11, 11, 23, 11, 11, 11, 11, 47, 13, 11, 29, 53, 11, 11, 11, 11, 11, 11, 11, 13, 11, 23, 11, 61, 11, 11, 37, 11, 11, 11, 13, 71, 11, 29, 11, 73, 11, 11, 11, 11, 23, 13, 11, 83, 11, 11, 11, 89, 11, 11, 47, 11, 13, 11, 11, 11, 29, 37, 53, 23, 11
Offset: 3

Views

Author

Keywords