This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A125635 #8 Apr 03 2014 11:35:08 %S A125635 2,1993,134857,716192579,68539500613,101479854517477,711236716682257, %T A125635 1646895113182602793,783453821802171722617,91545091731109499684503, %U A125635 5225628509593228805996529,1808125915932987167909775139 %N A125635 Smallest prime p such that 257^n divides p^256 - 1. %H A125635 W. Keller and J. Richstein <a href="http://www1.uni-hamburg.de/RRZ/W.Keller/FermatQuotient.html">Fermat quotients that are divisible by p</a>. %o A125635 (PARI) See A125609 %Y A125635 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. %K A125635 hard,nonn %O A125635 1,1 %A A125635 _Alexander Adamchuk_, Nov 28 2006 %E A125635 More terms from _Martin Fuller_, Jan 11 2007