|
Search: id:A108974
|
|
|
| A108974 |
|
Sort the primes (except 2) according to the multiplicative order of 2 modulo that prime. If two primes have the same order of 2, they are arranged numerically. |
|
+0
3
|
|
| 3, 7, 5, 31, 127, 17, 73, 11, 23, 89, 13, 8191, 43, 151, 257, 131071, 19, 524287, 41, 337, 683, 47, 178481, 241, 601, 1801, 2731, 262657, 29, 113, 233, 1103, 2089, 331, 2147483647, 65537, 599479, 43691, 71, 122921, 37, 109, 223, 616318177, 174763, 79
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
Or, primitive prime divisors of the Mersenne numbers 2^n-1 (see A000225) in their order of occurrence.
Of course the Mersenne primes 2^p-1 (cf. A000043) appear in this sequence.
|
|
REFERENCES
|
G. Everest et al., Primes generated by recurrence sequences, Amer. Math. Monthly, 114 (No. 5, 2007), 417-431.
K. Zsigmondy, Zur Theorie der Potenreste, Monatsh. Math., 3 (1892), 265-284.
|
|
EXAMPLE
|
The order of 2 modulo 3 is 2 and the order of 2 modulo 7 is 3. So 3 comes before 7.
|
|
CROSSREFS
|
Cf. A000225, A000043, A001348, A014664, A086251.
Adjacent sequences: A108971 A108972 A108973 this_sequence A108975 A108976 A108977
Sequence in context: A064078 A048857 A005420 this_sequence A106853 A083778 A107785
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Douglas Stones (dssto1(AT)student.monash.edu.au), Jul 27 2005
|
|
EXTENSIONS
|
More terms from Martin Fuller (martin_n_fuller(AT)btinternet.com), Sep 25 2006
|
|
|
Search completed in 0.002 seconds
|
