Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095978
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095978 Number of solutions to y^2=x^3+x (mod p) as p runs through the primes. +0
1
2, 3, 3, 7, 11, 19, 15, 19, 23, 19, 31, 35, 31, 43, 47, 67, 59, 51, 67, 71 (list; graph; listen)
OFFSET

1,1

REFERENCES

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

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: A155755 A080088 A098715 this_sequence A156763 A129012 A136122

Adjacent sequences: A095975 A095976 A095977 this_sequence A095979 A095980 A095981

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Jul 16 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research