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