|
Search: id:A108989
|
|
|
| A108989 |
|
Composite numbers n with primitive root 2; i.e. the order of 2 modulo n is phi(n). |
|
+0
1
|
|
| 9, 25, 27, 81, 121, 125, 169, 243, 361, 625, 729, 841, 1331, 1369, 2187, 2197, 2809, 3125, 3481, 3721, 4489, 6561, 6859, 6889, 10201, 11449, 14641, 15625, 17161, 19321, 19683, 22201, 24389, 26569, 28561, 29929, 32041, 32761, 38809, 44521, 50653
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
Modulo 9: 2^1=2, 2^2=4, 2^3=8, 2^4=7, 2^5=5, 2^6=1 and Phi(9)=6.
|
|
PROGRAM
|
(GAP) for i in [2..100000] do if not IsPrime(i) then if IsPrimitiveRootMod(2, i) then Display(i); fi; fi; od;
|
|
CROSSREFS
|
Cf. A001122.
Sequence in context: A075109 A117580 A020308 this_sequence A068583 A074852 A020252
Adjacent sequences: A108986 A108987 A108988 this_sequence A108990 A108991 A108992
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Douglas Stones (dssto1(AT)student.monash.edu.au), Jul 28 2005
|
|
|
Search completed in 0.002 seconds
|
