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 A238901 #10 Mar 15 2014 18:08:41
%S A238901 1,1,1,6,2,5,10,1,3,11,8,13,21,5,8,29,19,19,37,0,11,11,45,42,25,11,41,
%T A238901 7,62,39,55,70,29,60,49,24,1,0,47,73,49,78,52,11,80,80,28,32,0,92,117,
%U A238901 112,43,102,19,97,47,38,140,51,152,44,43,141
%N A238901 a(n) is the smallest k, 1<=k<=(p_n-3)/2, such that sum{i=1,...,p_n-2k-1} 2^(i-1) Binomial(k-1+i, k)/p_n is prime; a(n)=0, if such k does not exist.
%C A238901 Cf. comment in A238693.
%H A238901 Peter J. C. Moses, <a href="/A238901/b238901.txt">Table of n, a(n) for n = 4..1003</a>
%H A238901 V. Shevelev, <a href="http://arxiv.org/abs/1110.5686">Banach matchboxes problem and a congruence for primes</a>, arXiv:1110.5686
%Y A238901 Cf. A238693, A238697, A238698, A238700.
%K A238901 nonn
%O A238901 4,4
%A A238901 _Vladimir Shevelev_, Mar 06 2014
%E A238901 More terms from _Peter J. C. Moses_, Mar 06 2014