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 A021005 #10 Apr 02 2014 09:41:43
%S A021005 3,11,29,59,101,137,179,191,227,419,521,569,599,809,821,1019,1229,
%T A021005 1277,1289,1607,1667,1871,2081
%N A021005 Let q_k=p(p+2) be product of k-th pair of twin primes; sequence gives values of p such that (q_k)^2 > q_{k-i}q_{k+i} for all 1 <= i <= k-1.
%H A021005 Charles R Greathouse IV, <a href="/A021005/b021005.txt">Table of n, a(n) for n = 1..10000</a>
%e A021005 E.g. (11*13)^2 > (5*7)*(17*19): (11*13)^2 > (3*5)*(29*31).
%o A021005 (PARI) twins=List(); p=3;forprime(q=5,1e5,if(q-p==2,listput(twins,q)); p=q); for(k=1,(#twins+1)\2, for(i=1,k-1,if(twins[k]^2 < twins[k-i]*twins[k+i],next(2))); print1(twins[k]-2", ")) \\ _Charles R Greathouse IV_, Apr 02 2014
%Y A021005 Cf. A028388, A021007.
%K A021005 nonn
%O A021005 1,1
%A A021005 _Naohiro Nomoto_
%E A021005 a(1) inserted by _Charles R Greathouse IV_, Apr 02 2014