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 A263429 #10 Oct 31 2015 14:54:05 %S A263429 2,3,5,16843 %N A263429 Smallest prime p such that binomial(2*p-1, p-1) == 1 (mod p^n), or 0 if no such p exists. %C A263429 For n > 1, smallest p = prime(i) such that A244919(i) = n. %C A263429 For n > 3, p is a term of A088164. %C A263429 Conjecture: a(n) = 0 for n > 4 (McIntosh, 1995, p. 387). %H A263429 R. J. McIntosh, <a href="http://matwbn.icm.edu.pl/ksiazki/aa/aa71/aa7144.pdf">On the converse of Wolstenholme's theorem</a>, Acta Arithmetica, Vol. 71, No. 4 (1995), 381-389. %o A263429 (PARI) a(n) = my(p=2); while(Mod(binomial(2*p-1, p-1), p^n)!=1, p=nextprime(p+1)); p %Y A263429 Cf. A088164, A244919. %K A263429 nonn,hard,more,bref %O A263429 1,1 %A A263429 _Felix Fröhlich_, Oct 18 2015