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