Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078331
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078331 First prime such that p^2==1 (mod n). +0
1
2, 3, 2, 3, 11, 5, 13, 3, 17, 11, 23, 5, 53, 13, 11, 7, 67, 17, 37, 11, 13, 23, 47, 5, 101, 53, 53, 13, 59, 11, 61, 17, 23, 67, 29, 17, 73, 37, 53, 11, 83, 13, 173, 23, 19, 47, 281, 7, 97, 101, 67, 53, 107, 53, 89, 13, 37, 59, 353, 11, 367, 61, 71, 31, 79, 23, 269, 67, 47, 29 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(2)=3 because 3^2=9==1 (mod 2), while 2^2==0 (mod 2).

PROGRAM

(PARI) for (n=1, 100, forprime(p=2, 1000, if ((p^2-1)%n==0, print1(p", "); break)))

CROSSREFS

Sequence in context: A102310 A151546 A117936 this_sequence A093868 A077942 A077989

Adjacent sequences: A078328 A078329 A078330 this_sequence A078332 A078333 A078334

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Nov 21 2002

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research