login
A110955
Number of minimal signed binary representations for an integer n.
1
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, 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, 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
OFFSET
0,4
LINKS
A. D. Booth, A signed binary multiplication technique, Quarterly Journal on Mechanics and Applied Mathematics, Vol. 4 (1951) 236-240.
G. Manku and J. Sawada, A loopless Gray code for minimal signed-binary representations, 13th Annual European Symposium on Algorithms (ESA), LNCS 3669, (2005) 438-447.
J. Sawada, A Gray code for binary subtraction, 2nd Brazilian Conference on Graphs, Algorithms and Combinatorics (GRACO), Electronic Notes in Discrete Mathematics, 19 (2005) 125-131.
J. Sawada, A simple Gray code to list all minimal signed binary representations, SIAM Journal on Discrete Mathematics, Vol. 21 No. 1 (2007), 16-25.
CROSSREFS
Cf. A007302.
Sequence in context: A365708 A352999 A280747 * A211983 A173264 A056731
KEYWORD
nonn
AUTHOR
Joe Sawada, Sep 26 2005
STATUS
approved