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 A273085 #9 May 21 2016 22:52:43 %S A273085 3,5,5,5,23,29,37,41,67,113,113,113,197,617,881,10193,103867,521497, %T A273085 938071,1106356357,1546157677,100343116693,518914006417, %U A273085 1145565031404704513,135178919999357237393881,620712448371732926474772025689944913040651041015217889164158638163856301549281 %N A273085 Prime divisors of 68^112 - 1, listed with multiplicities. %C A273085 (68^112-1)/113 is the only known Fermat quotient q_p(b) = (b^(p-1)-1)/p with 1 < b < p and q_p(b) divisible by p^2. %H A273085 G. P. Michon, <a href="http://www.numericana.com/data/68.htm">Prime Factorization of 68^112-1</a>. %e A273085 68^112 == 1 (mod 113^3), but 68^112 =/= 1 (mod 113^4), so 113 appears three times in the sequence. %o A273085 (PARI) forprime(p=1, 68^112-1, my(k=1); while(Mod(68, p^k)^112==1, print1(p, ", "); k++)) %Y A273085 Cf. A172290, A242715. %K A273085 nonn,fini,full %O A273085 1,1 %A A273085 _Felix Fröhlich_, May 14 2016