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 A322015 #13 Dec 20 2018 23:17:55
%S A322015 0,0,3,0,0,6,7,0,0,0,11,12,0,14,15,0,0,0,19,0,0,22,23,24,0,0,27,28,0,
%T A322015 30,31,0,0,0,35,0,0,38,39,0,0,0,43,44,0,46,47,48,0,0,51,0,0,54,55,56,
%U A322015 0,0,59,60,0,62,63,0,0,0,67,0,0,70,71,0,0,0,75,76,0,78,79,0,0,0,83,0,0,86,87,88,0,0,91,92,0,94,95,96
%N A322015 If A003188(n+1) < A003188(n), then a(n) = n+1, otherwise a(n) = 0.
%H A322015 Antti Karttunen, <a href="/A322015/b322015.txt">Table of n, a(n) for n = 0..16383</a>
%H A322015 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%t A322015 With[{nn = 96}, ReplacePart[ConstantArray[0, nn], Map[# -> # &, 1 + Position[Partition[Array[BitXor[#, Floor[#/2]] &, nn], 2, 1], _?(First@ # > Last@ # &), {1}, Heads -> False][[All, 1]] ]]] (* _Michael De Vlieger_, Nov 25 2018 *)
%o A322015 (PARI)
%o A322015 A003188(n) = bitxor(n, n>>1);
%o A322015 A322015(n) = if(A003188(1+n)<A003188(n),1+n,0);
%Y A322015 Cf. A003188, A322016, A322017.
%Y A322015 Cf. also A091067, A255068.
%K A322015 nonn
%O A322015 0,3
%A A322015 _Antti Karttunen_, Nov 24 2018