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 A069231 #24 Jan 05 2018 22:02:42
%S A069231 4,9,21,51,55,62,74,77,82,86,87,91,106,122,123,129,134,142,143,145,
%T A069231 146,155,158,159,161,177,183,214,215,217,237,249,254,259,265,274,278,
%U A069231 298,299,301,309,334,335,339,341,343,358,365,371,377,382,386,394,395,407
%N A069231 Numbers n such that there are exactly 3 primes p satisfying the inequality n < p < n + tau(n)^2 where tau(n) = A000005(n).
%H A069231 Robert Israel, <a href="/A069231/b069231.txt">Table of n, a(n) for n = 1..10000</a>
%p A069231 filter:= n -> nops(select(isprime, [$(n+1) .. (n+numtheory:-tau(n)^2-1)]))=3:
%p A069231 select(filter, [$1..1000]); # _Robert Israel_, Jan 05 2018
%t A069231 fQ[n_] := Block[{r = Range[n, n + DivisorSigma[0, n]^2]}, If[ PrimeQ@ n, r = Rest@ r]; If[ PrimeQ[ r[[-1]]], r = Most@ r]; Length@ Select[r, PrimeQ] == 3]; Select[Range@410, fQ] (* _Robert G. Wilson v_, Jan 05 2018 *)
%o A069231 (PARI) isok(n) = #select(x->isprime(x), vector(numdiv(n)^2-1, k, k+n)) == 3; \\ _Michel Marcus_, Jun 18 2017
%Y A069231 Cf. A000005, A049591, A069230, A069232, A069233.
%K A069231 easy,nonn
%O A069231 1,1
%A A069231 _Benoit Cloitre_, Apr 13 2002