Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127209
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127209 Primes p such that there exists at least one x in 2...p-1 with x = order(x) modulo p. +0
1
3, 11, 13, 17, 19, 29, 31, 37, 41, 53, 59, 61, 67, 71, 73, 83, 89, 97, 101, 107, 131, 137, 139, 149, 163, 173, 179, 181, 191, 193, 197, 211, 227, 233, 241, 251, 269, 271, 281, 293, 307, 313, 317, 337, 347, 349, 373, 379, 389, 401, 409, 419, 421, 439, 443, 449 (list; graph; listen)
OFFSET

1,1

LINKS

N. Hobson, Home page (listed in lieu of email address)

EXAMPLE

13 is in the sequence because the order of 3 modulo 13 is 3.

PROGRAM

(PARI) forprime(p=3, 500, for(x=2, p-1, if(znorder(Mod(x, p))==x, print1(p, ", "); break)))

CROSSREFS

Sequence in context: A031449 A090260 A020635 this_sequence A052362 A001619 A071197

Adjacent sequences: A127206 A127207 A127208 this_sequence A127210 A127211 A127212

KEYWORD

easy,nonn

AUTHOR

Nick Hobson Jan 11 2007

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 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research