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 A038556 #16 Jul 25 2015 20:17:44
%S A038556 0,0,3,0,5,6,3,0,9,10,15,12,5,6,3,0,17,18,23,20,29,30,27,24,9,10,15,
%T A038556 12,5,6,3,0,33,34,39,36,45,46,43,40,57,58,63,60,53,54,51,48,17,18,23,
%U A038556 20,29,30,27,24,9,10,15,12,5,6,3,0,65,66,71,68,77,78,75,72,89,90,95,92,85
%N A038556 Periodic derivative of n.
%C A038556 Every term is an evil number (A001969) and every evil number occurs an infinite number of times in this sequence. Observe self-similarity in the graph of the sequence. - _T. D. Noe_, Jun 22 2007
%D A038556 Simmons, G. J. The structure of the differentiation digraphs of binary sequences. Ars Combin. 35 (1993), A, 71-88. Math. Rev. 95f:05052.
%H A038556 T. D. Noe, <a href="/A038556/b038556.txt">Table of n, a(n) for n=0..4096</a>
%F A038556 If n=b_k b_{k-1} ... b_0 in base 2, a(n) is number with binary expansion (b_k+b_{k-1}) (b_{k-1}+b_{k-2}) ... (b_1+b_0) (b_0+b_{k}). Also n XOR (n rotate 1).
%e A038556 11=1011->1100 so a(11)=12.
%t A038556 a[n_] := With[{bits = IntegerDigits[n, 2]}, FromDigits[ Thread[ BitXor[ bits, RotateLeft[bits]]], 2]]; Table[a[n], {n, 0, 76}] (* _Jean-François Alcover_, Aug 06 2012, from 2nd formula *)
%o A038556 (Haskell)
%o A038556 import Data.Bits (xor)
%o A038556 a038556 n = n `xor` (a053645 $ 2 * n + 1) :: Integer
%Y A038556 Cf. A038554, A038557.
%Y A038556 Cf. A053645.
%K A038556 nonn,nice,easy,look
%O A038556 0,3
%A A038556 _N. J. A. Sloane_
%E A038556 More terms from _Naohiro Nomoto_, Apr 08 2001