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