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.

A376073 Number of solutions of the congruence y^2 + y == x^3 - x^2 (mod p) as p runs through the primes.

Original entry on oeis.org

4, 4, 4, 9, 10, 9, 19, 19, 24, 29, 24, 34, 49, 49, 39, 59, 54, 49, 74, 74, 69, 89, 89, 74, 104, 99, 119, 89, 99, 104, 119, 149, 144, 129, 159, 149, 164, 159, 179, 179, 194, 174, 174, 189, 199, 199, 199, 204, 209, 214, 209, 269, 249, 274, 259, 249, 259, 299, 279, 299
Offset: 1

Views

Author

Andrey Zabolotskiy, Sep 08 2024

Keywords

Comments

Same as A272196, except for a(1).

References

  • Edward Frenkel, Love and math: the heart of hidden reality, Basic Books, 2013. See pages 86-89.

Crossrefs

Formula

a(n) = prime(n) - A002070(n).
a(n) = A060457(prime(n)).