|
Search: id:A137332
|
|
|
| A137332 |
|
Primes which are equal to the order of 2 modulo a prime q, sorted with respect to the value of q. |
|
+0
1
|
|
| 2, 3, 11, 5, 23, 11, 7, 83, 37, 29, 131, 179, 191, 43, 73, 239, 251, 359, 419, 431, 443, 491, 29, 659, 683, 233, 179, 719, 743, 911, 239, 1019, 1031, 29, 1103, 47, 397, 1223, 79, 461, 1439, 1451, 1499, 1511, 1559, 1583, 557, 113, 431, 577, 601, 1811, 1931
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
This is a multipermutation of the primes A000040 with every prime p appearing exactly A001221(2^p-1) times. - Max Alekseyev (maxal(AT)cs.ucsd.edu), May 01 2008
|
|
LINKS
|
Joerg Arndt (arndt(AT)jjj.de), Apr 07 2008, Table of n, a(n) for n = 1..106
|
|
FORMULA
|
a(n) = A002326( (A122094(n) - 1) / 2 ) - Max Alekseyev (maxal(AT)cs.ucsd.edu), May 01 2008
|
|
EXAMPLE
|
The k-th element of the sequence is ord(2 mod A122094(k)).
For example, 223 is the 9-th entry of A122094, and ord(2 mod 223)=37, so 37 is the 9-th entry of this sequence.
11 is the third entry because ord(2 mod 23) == 11, and
the sixth entry because ord(2 mod 89) == 11.
Note both 23 and 89 divide 2^11-1;
the third and sixth entry of A122094 are 23 and 89.
|
|
PROGRAM
|
(PARI) forprime (p=3, 10^4, r = znorder( Mod(2, p) ); if ( isprime(r), print1(r, ", "); ); );
|
|
CROSSREFS
|
Cf. A122094.
Adjacent sequences: A137329 A137330 A137331 this_sequence A137333 A137334 A137335
Sequence in context: A030391 A039654 A075240 this_sequence A084047 A127376 A086146
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joerg Arndt (arndt(AT)jjj.de), Apr 07 2008
|
|
EXTENSIONS
|
Definition revised by Max Alekseyev (maxal(AT)cs.ucsd.edu), May 01 2008
|
|
|
Search completed in 0.002 seconds
|
