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 A330956 #7 Jan 05 2020 12:57:45 %S A330956 0,0,0,1,0,1,1,1,0,1,2,2,2,2,2,3,0,1,2,3,2,3,3,3,2,3,3,3,3,3,3,3,0,1, %T A330956 2,3,4,4,4,4,4,4,4,5,4,5,5,5,4,4,4,5,4,5,6,6,4,5,6,6,6,6,6,7,0,1,2,3, %U A330956 4,5,6,7,4,5,6,7,6,7,7,7,4,5,6,7,6,7,7 %N A330956 For any n >= 0: consider all pairs of numbers (x, y) whose binary representations can be interleaved (or shuffled) to produce the binary representation of n (possibly with leading zeros); a(n) is the greatest possible value of min(x, y). %H A330956 Rémy Sigrist, <a href="/A330956/a330956.txt">C program for A330956</a> %H A330956 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %e A330956 For n = 5: %e A330956 - the binary representation of 5 is "101", %e A330956 - the possible values for (x, y), restricted to x >= y without loss of generality, are: %e A330956 bin(5) x y min(x, y) %e A330956 ------- - - --------- %e A330956 "101" 5 0 0 %e A330956 "1/01" 1 1 1 %e A330956 "10/1" 2 1 1 %e A330956 "1/0/1" 3 0 0 %e A330956 - hence a(5) = 1. %o A330956 (C) See Links section. %Y A330956 See A330925 for similar sequences. %Y A330956 Cf. A327193. %K A330956 nonn,base %O A330956 0,11 %A A330956 _Rémy Sigrist_, Jan 04 2020