|
Search: id:A125609
|
|
|
| A125609 |
|
Smallest prime p such that 3^n divides p^2 - 1. |
|
+0
22
|
|
| 2, 17, 53, 163, 487, 1459, 4373, 13121, 39367, 472391, 1062881, 1062881, 19131877, 19131877, 57395627, 86093443, 258280327, 3874204891, 6973568801, 6973568801, 188286357653, 188286357653, 188286357653, 4518872583697, 15251194969973
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
Martin Fuller, PARI program
W. Keller and J. Richstein Fermat quotients that are divisible by p.
|
|
PROGRAM
|
For PARI program see link.
|
|
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. A125611 = Smallest prime p such that 7^n divides p^6 - 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: A073775 A141860 A105691 this_sequence A100518 A125200 A071402
Adjacent sequences: A125606 A125607 A125608 this_sequence A125610 A125611 A125612
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 28 2006
|
|
EXTENSIONS
|
Corrected and extended by Ryan Propper (rpropper(AT)stanford.edu), Jan 01 2007
More terms from Martin Fuller (martin_n_fuller(AT)btinternet.com), Jan 11 2007
|
|
|
Search completed in 0.002 seconds
|
