Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #14 Jul 23 2014 03:19:12
%S 1,1,1,2,1,1,2,1,1,1,1,3,2,3,1,1,1,1,1,2,1,1,3,2,2,2,3,1,1,2,1,1,1,1,
%T 1,2,1,1,2,1,1,1,1,4,3,5,2,2,2,2,2,5,3,4,1,1,1,1,2,1,1,2,1,1,1,1,1,2,
%U 1,1,2,1,1,1,1,3,2,3,1,1,1,1,1,2,1,1,4,3,3,3,5,2,2,4,2,2,2,2,2,4,2
%N Number of minimal signed binary representations for an integer n.
%H A. D. Booth, <a href="http://dx.doi.org/10.1093/qjmam/4.2.236">A signed binary multiplication technique</a>, Quarterly Journal on Mechanics and Applied Mathematics, Vol. 4 (1951) 236-240.
%H G. Manku and J. Sawada, <a href="http://dx.doi.org/10.1007/11561071_40">A loopless Gray code for minimal signed-binary representations</a>, 13th Annual European Symposium on Algorithms (ESA), LNCS 3669, (2005) 438-447.
%H J. Sawada, <a href="http://dx.doi.org/10.1016/j.endm.2005.05.018">A Gray code for binary subtraction</a>, 2nd Brazilian Conference on Graphs, Algorithms and Combinatorics (GRACO), Electronic Notes in Discrete Mathematics, 19 (2005) 125-131.
%H J. Sawada, <a href="http://dx.doi.org/10.1137/050641405">A simple Gray code to list all minimal signed binary representations</a>, SIAM Journal on Discrete Mathematics, Vol. 21 No. 1 (2007), 16-25.
%Y Cf. A007302.
%K nonn
%O 0,4
%A _Joe Sawada_, Sep 26 2005