|
Search: id:A110955
|
|
|
| A110955 |
|
Number of minimal signed binary representations for an integer n. |
|
+0
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
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
A. D. Booth, A signed binary multiplication technique, Querterly 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.
|
|
CROSSREFS
|
Cf. A007302.
Sequence in context: A120891 A034002 A025430 this_sequence A056731 A042974 A020906
Adjacent sequences: A110952 A110953 A110954 this_sequence A110956 A110957 A110958
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Joe Sawada (sawada(AT)cis.uoguelph.ca), Sep 26 2005
|
|
|
Search completed in 0.002 seconds
|
