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 A095901 #8 Mar 21 2017 13:34:56
%S A095901 1,1,0,0,1,0,0,0,1,0,1,1,0,0,0,0,1,0,1,0,0,1,0,0,1,1,1,0,0,0,0,0,1,0,
%T A095901 1,0,1,1,0,1,0,0,1,0,0,1,1,1,0,1,1,0,0,0,1,1,1,1,0,0,0,0,0,0,1,0,1,0,
%U A095901 1,0,0,1,0,1,0,0,1,0,1,1,0,1,1,0,0,0,1,0,1,1,0,1,1,0,0,0,1,0,0,1,1,1,0,0,0
%N A095901 A004001 (mod 2).
%H A095901 Antti Karttunen, <a href="/A095901/b095901.txt">Table of n, a(n) for n = 1..8192</a>
%F A095901 a(n) = A004001(n) mod 2.
%t A095901 a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; Table[ a[n], {n, 105}]
%o A095901 (Scheme) (define (A095901 n) (A000035 (A004001 n))) ;; Further code found under those two entries, _Antti Karttunen_, Mar 21 2017
%Y A095901 Cf. A000035, A004001.
%Y A095901 Cf. A095902 (number of odd entries less than or equal to 2^n).
%Y A095901 Cf. A283480 (partial sums).
%Y A095901 Characteristic function of A283481.
%K A095901 easy,nonn
%O A095901 1,1
%A A095901 _Robert G. Wilson v_, Jun 12 2004