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 A093339 #6 Nov 21 2013 12:48:18
%S A093339 2,3,5,7,0,0,0,0,1,2,3,3,3,4,5,5,6,6,7,7,8,9,9,9,9,1,2,2,2,3,3,4,5,5,
%T A093339 6,6,7,7,8,8,9,0,1,1,1,3,3,4,4,5,5,6,7,7,8,8,9,0,0,1,2,3,3,3,4,4,5,6,
%U A093339 6,6,7,8,9,9,0,0,2,2,4,4,5,6,6,7,7,8,9,9,0,0,1,1,1,3,4,4,4,5,5,6,7,7,8,9,0
%N A093339 Middle digits of primes with an odd number of digits.
%H A093339 Harvey P. Dale, <a href="/A093339/b093339.txt">Table of n, a(n) for n = 2..1000</a>
%t A093339 mdp[n_]:=Module[{idn=IntegerDigits[n],len=IntegerLength[n]},If[EvenQ[len], -1,idn[[(len-1)/2+1]]]]; Select[mdp/@Prime[Range[500]],NonNegative] (* _Harvey P. Dale_, Feb 26 2012 *)
%o A093339 (PARI) midd(n) = { forprime(x=2,n, s = Str(x); ln = length(s); if(ln<2,p=1,p = (ln-1)/2+1); if(ln%2, md = eval(mid(s,p,1)); print1(md",") ) ) } \ Get a substring of length n from string str starting at position s in str. mid(str,s,n) = { v =""; tmp = Vec(str); ln=length(tmp); for(x=s,s+n-1, v=concat(v,tmp[x]); ); return(v) }
%Y A093339 Cf. A077648, A007652.
%K A093339 base,nonn
%O A093339 2,1
%A A093339 _Cino Hilliard_, Apr 25 2004