|
%I #7 Jan 05 2020 12:58:41
%S 0,1,1,0,1,0,3,8,1,0,0,5,0,5,5,0,1,0,0,5,0,5,5,0,9,7,5,0,7,16,27,40,1,
%T 0,0,5,0,5,5,0,0,7,5,0,7,0,11,24,0,8,5,0,7,0,0,13,20,11,0,13,0,13,13,
%U 0,1,0,0,5,0,5,5,0,0,7,5,0,7,0,11,24,0,8,5
%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 abs(x^2 - y^2).
%H Rémy Sigrist, <a href="/A330963/a330963.txt">C program for A330963</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 0
%e "10/1" 2 1 3
%e "1/0/1" 3 0 9
%e - hence a(5) = 0.
%o (C) See Links section.
%Y See A330925 for similar sequences.
%Y Cf. A327195.
%K nonn,base
%O 0,7
%A _Rémy Sigrist_, Jan 04 2020
|
