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 A260209 #24 Aug 18 2015 12:24:22
%S A260209 1,3,25,245,121,169,867,3249,6877,9251,961,15059,57154,61017,68479,
%T A260209 106742,201898,208376,107736,176435,330398,237158,158447,213867,
%U A260209 903264,856884,21218,755634,1259386,944906,161290,531991,150152,656914,1287658,592826,640874
%N A260209 Values A such that p=prime(n) satisfies binomial(2p-1, p-1) == 1 + A*p (mod p^4).
%C A260209 p is a Wolstenholme prime (A088164) iff a(n) == 0. This holds for n = 1944 and n = 157504.
%C A260209 When performing a search for Wolstenholme primes, one can choose an integer constant c >= 0 and record all primes p with A <= c in order to get a larger data set.
%C A260209 The values here asymptotically appear to grow more quickly than those in A260210.
%C A260209 It appears that a(n)/A260210(n) = A001248(n) for all n.
%H A260209 Felix Fröhlich, <a href="/A260209/b260209.txt">Table of n, a(n) for n = 1..10000</a>
%t A260209 f[n_] := Block[{p = Prime@ n}, (Mod[ Binomial[2p - 1, p - 1], p^4] - 1)/p]; Array[f, 37] (* _Robert G. Wilson v_, Jul 29 2015 *)
%o A260209 (PARI) a(n) = p=prime(n); (lift(Mod(binomial(2*p-1, p-1), p^4))-1)/p
%Y A260209 Cf. A088164, A241014, A244801, A250406, A258367, A260210.
%K A260209 nonn
%O A260209 1,2
%A A260209 _Felix Fröhlich_, Jul 19 2015