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.

This page as a plain text file.
%I A376073 #5 Sep 09 2024 09:35:49
%S A376073 4,4,4,9,10,9,19,19,24,29,24,34,49,49,39,59,54,49,74,74,69,89,89,74,
%T A376073 104,99,119,89,99,104,119,149,144,129,159,149,164,159,179,179,194,174,
%U A376073 174,189,199,199,199,204,209,214,209,269,249,274,259,249,259,299,279,299
%N A376073 Number of solutions of the congruence y^2 + y == x^3 - x^2 (mod p) as p runs through the primes.
%C A376073 Same as A272196, except for a(1).
%D A376073 Edward Frenkel, Love and math: the heart of hidden reality, Basic Books, 2013. See pages 86-89.
%H A376073 LMFDB, <a href="https://www.lmfdb.org/EllipticCurve/Q/11/a/3">Elliptic curve with LMFDB label 11.a3</a>.
%F A376073 a(n) = prime(n) - A002070(n).
%F A376073 a(n) = A060457(prime(n)).
%Y A376073 Cf. A002070, A006571, A060457, A272196.
%K A376073 nonn
%O A376073 1,1
%A A376073 _Andrey Zabolotskiy_, Sep 08 2024