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 A227203 #21 Dec 26 2017 12:41:16
%S A227203 4,1,1,13,1,19,1,25,9,1,9,43,1,49,9,9,1,9,73,1,9,85,9,109,103,1,109,1,
%T A227203 115,49,133,9,1,25,1,9,9,169,9,9,1,25,1,199,1,241,253,229,1,235,9,1,
%U A227203 25,9,9,9,1,9,283,1,25,49,313,1,319,49,9,25,1,355,9,379
%N A227203 Prime(n)^2 mod (prime(n) + prime(n+1)).
%C A227203 a(n) = 1 if and only if prime(n) and prime(n+1) are twin prime pair (that is, prime(n+1) = 2 + prime(n)).
%t A227203 Table[Mod[Prime[n]^2, Prime[n] + Prime[n + 1]], {n, 200}]
%t A227203 PowerMod[#[[1]],2,Total[#]]&/@Partition[Prime[Range[80]],2,1] (* _Harvey P. Dale_, Dec 26 2017 *)
%o A227203 (PARI) for(n=1,200,print1(prime(n)^2%(prime(n)+prime(n+1))","))
%Y A227203 Cf. A029707, A167770.
%K A227203 nonn
%O A227203 1,1
%A A227203 _Zak Seidov_, Sep 18 2013