|
Search: id:A141629
|
|
|
| A141629 |
|
Least overpseudoprimes to base 2 a(n) such that the multiplicative order of 2 mod a(n) equals 8n+20. |
|
+0
2
|
|
| 3277, 4033, 838861, 85489, 80581, 130561, 104653, 20647621, 280601, 818201, 68719214593
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
C. Pomerance proved (private correspondence) that for every n>=1 there exists at least one overpseudoprime (a(n)) for which the multiplicative order of 2 mod a(n) equals 8n+20.
|
|
REFERENCES
|
V. Shevelev, An upper estimate for the overpseudoprime counting function, arxiv.org/abs/0807.1975
|
|
CROSSREFS
|
Cf. A141232 A122929 A140452 A140797 A140803.
Sequence in context: A101706 A031820 A048959 this_sequence A116460 A015326 A043472
Adjacent sequences: A141626 A141627 A141628 this_sequence A141630 A141631 A141632
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladimir Shevelev (shevelev(AT)bgu.ac.il), Aug 24 2008
|
|
|
Search completed in 0.002 seconds
|
