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 A104037 #12 Feb 16 2025 08:32:56
%S A104037 1,1,1,1,1,0,0,1,1,0,0,0,1,0,0,1,1,1,1,0,0,0,0,0,1,1,1,1,0,0,0,0,0,1,
%T A104037 1,1,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,1,1,1,
%U A104037 1,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,1,0,0,1,1
%N A104037 Numbers of primes between two sexy primes.
%H A104037 Robert Israel, <a href="/A104037/b104037.txt">Table of n, a(n) for n = 1..10000</a>
%H A104037 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/SexyPrimes.html">Sexy Primes</a>. [The definition in this webpage is unsatisfactory, because it defines a "sexy prime" as a pair of primes.- _N. J. A. Sloane_, Mar 07 2021].
%p A104037 p:=1: q:= 0: r:= 1: s:= 1: count:= 0: Res:= NULL:
%p A104037 while count < 100 do
%p A104037 t:= charfcn[{true}](isprime(p+6));
%p A104037 if t=1 and q=1 then
%p A104037 count:= count + 1;
%p A104037 Res:= Res, r+s;
%p A104037 fi;
%p A104037 p:= p+2;
%p A104037 q:= r; r:= s; s:= t;
%p A104037 od:
%p A104037 Res; # _Robert Israel_, Jun 23 2019
%Y A104037 Cf. A023201 (sexy primes), A046117.
%K A104037 easy,nonn
%O A104037 1,1
%A A104037 _Giovanni Teofilatto_, Mar 31 2005
%E A104037 Corrected and extended by _Robert Israel_, Jun 23 2019