login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A095978 Number of solutions to y^2=x^3+x (mod p) as p runs through the primes. 0
2, 3, 3, 7, 11, 19, 15, 19, 23, 19, 31, 35, 31, 43, 47, 67, 59, 51, 67, 71 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

J. H. Silverman, A Friendly Introduction to Number Theory, pp. 351, Prentice Hall NJ, 2001.

LINKS

Table of n, a(n) for n=1..20.

FORMULA

a(n)=p for p==3 (mod 4). a(n)=p-+2*A002972(n), sign chosen according as to A002972(n)==-+1 (mod 4), for p==1 (mod 4).

CROSSREFS

Sequence in context: A080088 A098715 A167886 * A156763 A169653 A129012

Adjacent sequences:  A095975 A095976 A095977 * A095979 A095980 A095981

KEYWORD

nonn

AUTHOR

Lekraj Beedassy, Jul 16 2004

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified April 18 11:01 EDT 2014. Contains 240707 sequences.