|
|
A321319
|
|
Smallest power of 2 obtainable by partitioning the binary representation of n into consecutive blocks and then summing.
|
|
4
|
|
|
1, 1, 2, 1, 2, 2, 4, 1, 2, 2, 4, 2, 4, 4, 4, 1, 2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 16, 1, 2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 8, 2, 4, 4, 4, 4, 4, 4, 8, 4, 4, 4, 8, 4, 8, 8, 8, 1, 2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 8, 2, 4, 4, 4, 4, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
E. Berlekamp, J. Buhler, Puzzle 6, Puzzles column, Emissary Fall (2011) 9.
|
|
EXAMPLE
|
For n = 13, we can partition its binary representation as follows (showing partition and sum of terms): (1101):13, (1)(101):6, (11)(01):4, (110)(1):7, (1)(1)(01):3, (1)(10)(1):4, (11)(0)(1):4, (1)(1)(0)(1):3. Thus the smallest power of 2 is 4.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|