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 A072609 #8 Dec 21 2014 19:36:56
%S A072609 0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,
%T A072609 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,
%U A072609 0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A072609 Changing of parity of remainder A072608(n) from alternation [..010101..] to steadily 1-range [...1111..]. AC-range corresponds to 0, while DC-range labeled by 1.
%F A072609 a(n)=Mod[A004648(n), 2]*Mod[A004648(n+1), 2]= A072608(n)*A072608(n+1)
%e A072609 Take n = 11,12,13,14: A004648[n]=9,1,2,1. Parity A072608(n) = 1,1,0,1. So ..11.. transforms into 01 between n = 11 and n = 12: a(11) = 1, a(12)=0. With increasing n, A072609(n) changes from ..0000.. into ...1111. reflected by this sequence. by a range consisting only of 1-s. This secondary alternation also goes on.
%t A072609 mm[x_] := Mod[Mod[Prime[x], x], 2] Table[mm[w]*mm[w+1], {w, 1, 256}]
%t A072609 Times@@@Partition[Table[Mod[Mod[Prime[n],n],2],{n,110}],2,1] (* _Harvey P. Dale_, Dec 21 2014 *)
%Y A072609 Cf. A004648, A072608.
%K A072609 nice,nonn
%O A072609 1,1
%A A072609 _Labos Elemer_, Jun 24 2002