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 A106671 #12 Apr 21 2017 15:55:08
%S A106671 1,2,0,0,0,0,0,1,1,1,1,0,0,1,0,1,1,1,0,1,1,1,1,0,0,0,0,0,0,0,1,1,0,0,
%T A106671 1,0,1,1,0,1,0,0,0,0,1,0,1,0,0,1,1,0,1,0,0,1,1,1,0,0,0,0,0,0,0,1,1,0,
%U A106671 0,1,1,1,0,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,1,1,0,0,0,1,0,1,1,0,1,1,0,1,1,1
%N A106671 a(n) = ( prime(n + 2) * prime(n) - prime(n + 1)^2 ) modulo 3.
%H A106671 G. C. Greubel, <a href="/A106671/b106671.txt">Table of n, a(n) for n = 1..1000</a>
%F A106671 a(n) = A056221(n) mod 3 = A010872(A056221(n)). - _Michel Marcus_, Apr 21 2017
%t A106671 a = Table[Mod[Prime[n + 2]*Prime[n] - Prime[n + 1]^2, 3], {n, 1, 200}]
%t A106671 Mod[#[[3]]#[[1]]-#[[2]]^2,3]&/@Partition[Prime[Range[110]],3,1] (* _Harvey P. Dale_, Oct 03 2015 *)
%o A106671 (PARI) a(n) = (prime(n + 2)*prime(n) - prime(n + 1)^2) % 3; \\ _Michel Marcus_, Apr 21 2017
%Y A106671 Cf. A010872, A056221.
%K A106671 nonn,less
%O A106671 1,2
%A A106671 _Roger L. Bagula_, May 13 2005