login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A127437
Duplicate of A001915.
1
2, 5, 11, 13, 19, 23, 29, 37, 47, 53, 59, 61, 67, 71, 83, 97, 101, 107, 131, 139, 149, 163, 167, 173, 179, 181, 191, 193, 197, 211, 227, 239, 263, 269, 293, 307, 311, 313, 317, 347, 349, 359, 373, 379, 383, 389, 409, 419, 421, 431, 443, 461, 467, 479, 491, 499, 503, 509, 523, 541, 547, 557, 563, 577
OFFSET
1,1
COMMENTS
Potential prime divisors of solutions to 2^m == 3 (mod m) (see A050259).
Minimal nonnegative solutions to 2^x == 3 (mod a(n)) are given in A127438.
PROG
(PARI) forprime(p=5, 1000, g=znprimroot(p); u=znlog(Mod(2, p), g); v=znlog(Mod(3, p), g); if( v%u==0, print1(p, ", "); ))
CROSSREFS
Cf. A050259, A123988 (complement in the primes).
Sequence in context: A194854 A045360 A001915 * A339035 A084792 A109640
KEYWORD
dead
AUTHOR
Max Alekseyev, Jan 14 2007
EXTENSIONS
Corrected by Max Alekseyev, Jun 08 2011
Corrected by Arkadiusz Wesolowski, Jan 12 2021
STATUS
approved