login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A276193 P-defects p - N(p) of the congruence y^2 + x*y + y == x^3 + 4*x - 6 (mod p) for primes p, where N(p) is the number of solutions given for p = prime(n) by A276173(n). 2
-1, -2, 0, 1, 0, -4, 6, 2, 0, -6, -4, 2, 6, 8, -12, 6, -6, 8, -4, 0, 2, 8, -6, -6, -10, 0, -4, 12, 2, 6, -16, 18, 18, 14, -18, 8, -4, -16, -12, -12, -12, 20, 24, 14, -18, 20, -4, 8, 18, -4, -6, 24, -10, -18, 18, 0, -12, -16, -10, -6, -22, 24, 2, -24, -10, 6, 8, 14, -24, -28, 18, -24, 8, 14, -16, 36, 18, 20, -18, 14, 6, -10, 24, -34, 8, -12, 18, -10, 12, 32, -6, -36, -16, -12, -4, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = prime(n) - A276173(n), n >= 1, where A276173(n) is the number of solutions to the congruence y^2 + x*y + y == x^3 + 4*x - 6 (mod prime(n)).
CROSSREFS
Cf. A276173.
Sequence in context: A362834 A362839 A362837 * A357400 A238618 A132277
KEYWORD
sign
AUTHOR
Seiichi Manyama, Sep 10 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 2 00:20 EDT 2024. Contains 375600 sequences. (Running on oeis4.)