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 A096455 #11 Aug 29 2021 19:44:42
%S A096455 13,19,43,53,71,79,139,163,173,193,199,223,229,263,281,293,311,317,
%T A096455 383,409,433,593,613,619,641,647,659,673,683,701,719,733,769,809,821,
%U A096455 827,839,911,929,941,1151,1163,1181,1231,1277,1283,1301,1307,1321,1439,1451
%N A096455 Primes p such that the number of primes q, 7 <= q < p, congruent to 1 or 2 mod 5, is two more than the number of such primes congruent to 3 or 4 mod 5.
%H A096455 Harvey P. Dale, <a href="/A096455/b096455.txt">Table of n, a(n) for n = 1..1000</a>
%t A096455 Prime[#+4]&/@Flatten[Position[Accumulate[Table[Which[Mod[n,5] == 1,1,Mod[ n,5] == 2,1,Mod[ n,5] == 3,-1,Mod[n,5]==4,-1],{n,Prime[ Range[ 4,250]]}]],2]] (* _Harvey P. Dale_, Aug 29 2021 *)
%Y A096455 Cf. A096447-A096454.
%K A096455 nonn,easy
%O A096455 1,1
%A A096455 _Yasutoshi Kohmoto_, Aug 12 2004
%E A096455 More terms and better definition from _Joshua Zucker_, May 21 2006