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 A104107 #11 Oct 13 2019 10:18:12
%S A104107 1,0,0,0,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,0,0,0,1,1,0,0,1,1,1,0,0,1,0,0,
%T A104107 0,1,1,1,0,0,0,1,1,0,1,1,1,0,0,0,0,1,1,1,0,0,1,0,0,0,1,1,1,0,0,0,1,1,
%U A104107 0,1,1,1,0,0,1,1,0,0,0,1,1,0,1,1,1,0,0,0,1,1,1,0,0,1,0,0,0,1,1,0,1,1,1,0,0
%N A104107 a(1) = 1, c(1)=1, if A(k) = sequence of first c(k) terms and if B(k) is A(k) with 0's and 1's exchanged, then A(k+1) = A(k)B(k) and c(k+1)= 2*c(k) if a(k) = 0, A(k+1) = A(k),0,B(k) and c(k+1)= 2*c(k)+1 if a(k) = 1.
%t A104107 f[l_]:=Join[l,If[l[[Floor[Log[2,Length[l]]]+1]]==0,{},{0}],1-l];Nest[f,{1},7] (* _Ray Chandler_, Apr 05 2009 *)
%Y A104107 Cf. A104104, A104105, A104106, A104108.
%K A104107 easy,nonn
%O A104107 1,1
%A A104107 _Leroy Quet_, Mar 04 2005
%E A104107 Edited and extended by _Ray Chandler_, Apr 05 2009