|
Search: id:A125611
|
|
|
| A125611 |
|
Smallest prime p such that 7^n divides p^6 - 1. |
|
+0
22
|
|
| 2, 19, 19, 3449, 32261, 152617, 3294173, 3376853, 135967277, 135967277, 7909306973, 92233439147, 115385868869, 1356446145697, 56020344873707, 56020344873707, 930522055948829, 9116268492336169, 10744682090246617
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
W. Keller and J. Richstein Fermat quotients that are divisible by p.
|
|
PROGRAM
|
(PARI) See A125609
|
|
CROSSREFS
|
Cf. A125609 = Smallest prime p such that 3^n divides p^2 - 1. Cf. A125610 = Smallest prime p such that 5^n divides p^4 - 1. Cf. A125612 = Smallest prime p such that 11^n divides p^10 - 1. Cf. A125632 = Smallest prime p such that 13^n divides p^12 - 1. Cf. A125633 = Smallest prime p such that 17^n divides p^16 - 1. Cf. A125634 = Smallest prime p such that 19^n divides p^18 - 1. Cf. A125635 = Smallest prime p such that 257^n divides p^256 - 1.
Sequence in context: A065643 A038031 A132129 this_sequence A022119 A042247 A041451
Adjacent sequences: A125608 A125609 A125610 this_sequence A125612 A125613 A125614
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 28 2006
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)stanford.edu), Jan 03 2007
More terms from Martin Fuller (martin_n_fuller(AT)btinternet.com), Jan 11 2007
|
|
|
Search completed in 0.002 seconds
|
