|
Search: id:A125635
|
|
|
| A125635 |
|
Smallest prime p such that 257^n divides p^256 - 1. |
|
+0
20
|
|
| 2, 1993, 134857, 716192579, 68539500613, 101479854517477, 711236716682257, 1646895113182602793, 783453821802171722617, 91545091731109499684503, 5225628509593228805996529, 1808125915932987167909775139
(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. 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.
Sequence in context: A080642 A108331 A113917 this_sequence A124361 A024034 A101722
Adjacent sequences: A125632 A125633 A125634 this_sequence A125636 A125637 A125638
|
|
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
|
