|
Search: id:A125632
|
|
|
| A125632 |
|
Smallest prime p such that 13^n divides p^12 - 1. |
|
+0
22
|
|
| 2, 19, 239, 239, 220861, 7654109, 533810141, 533810141, 822557039, 38050596989, 2395794301259, 58713568184837, 358661570404751, 22771419458231473, 65106791321062951, 1951482088631313647, 13942901952235522979
(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. 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. 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: A091852 A024227 A106945 this_sequence A124125 A065923 A094476
Adjacent sequences: A125629 A125630 A125631 this_sequence A125633 A125634 A125635
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 28 2006
|
|
EXTENSIONS
|
More terms from Martin Fuller (martin_n_fuller(AT)btinternet.com), Jan 11 2007
|
|
|
Search completed in 0.002 seconds
|
