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 A330957 #7 Jan 05 2020 12:58:00 %S A330957 0,1,1,1,1,1,2,3,1,1,2,3,2,3,3,3,1,1,2,3,2,3,3,3,3,3,3,3,4,5,6,7,1,1, %T A330957 2,3,2,3,3,3,3,3,3,3,4,5,6,7,3,3,3,3,4,5,6,7,6,6,6,7,6,7,7,7,1,1,2,3, %U A330957 2,3,3,3,3,3,3,3,4,5,6,7,3,3,3,3,4,5,6 %N A330957 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 least possible value of max(x, y). %H A330957 Rémy Sigrist, <a href="/A330957/a330957.txt">C program for A330957</a> %H A330957 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %e A330957 For n = 5: %e A330957 - the binary representation of 5 is "101", %e A330957 - the possible values for (x, y), restricted to x >= y without loss of generality, are: %e A330957 bin(5) x y max(x, y) %e A330957 ------- - - --------- %e A330957 "101" 5 0 5 %e A330957 "1/01" 1 1 1 %e A330957 "10/1" 2 1 2 %e A330957 "1/0/1" 3 0 3 %e A330957 - hence a(5) = 1. %o A330957 (C) See Links section. %Y A330957 See A330925 for similar sequences. %Y A330957 Cf. A327192. %K A330957 nonn,base %O A330957 0,7 %A A330957 _Rémy Sigrist_, Jan 04 2020