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 A100810 #10 Oct 02 2020 18:41:33
%S A100810 1,0,0,1,0,1,0,1,1,0,1,1,0,1,1,1,0,1,1,0,1,1,1,1,1,0,1,0,1,1,1,1,0,1,
%T A100810 0,1,1,1,1,1,0,1,0,1,0,1,1,1,0,1,1,0,1,1,1,1,0,1,1,0,1,1,1,0,1,1,1,1,
%U A100810 0,1,1,1,1,1,1,1,1,1,1,1,0,1,0,1,1,1,1,1,0,1,1,1,1,1,1,1,1,0,1,1,1,1,1,0,1
%N A100810 a(n) = 0 if prime(n) + 2 = prime(n+1), otherwise 1.
%F A100810 a(n) = 1 - A100821(n) = 1 - A062301(n+1).
%e A100810 a(2) = 0 because prime(2) + 2 = 5 = prime(3).
%e A100810 a(3) = 0 because prime(3) + 2 = 7 = prime(4).
%p A100810 a:= n-> `if`(isprime(ithprime(n)+2), 0, 1):
%p A100810 seq(a(n), n=1..105); # _Alois P. Heinz_, Oct 02 2020
%t A100810 Table[If[Prime[n] + 2 == Prime[n + 1], 0, 1], {n, 120}] (* _Ray Chandler_, Jan 09 2005 *)
%t A100810 If[#[[2]]-#[[1]]==2,0,1]&/@Partition[Prime[Range[110]],2,1] (* _Harvey P. Dale_, Mar 05 2016 *)
%K A100810 easy,nonn
%O A100810 1,1
%A A100810 _Giovanni Teofilatto_, Jan 05 2005
%E A100810 Corrected and extended by _Ray Chandler_, Jan 09 2005