|
|
A139707
|
|
Take n in binary. Rotate the binary digits to the right until a 1 once again appears as the leftmost digit. a(n) is result written in binary.
|
|
3
|
|
|
1, 10, 11, 100, 110, 101, 111, 1000, 1100, 1010, 1101, 1001, 1110, 1011, 1111, 10000, 11000, 10100, 11001, 10010, 11010, 10101, 11011, 10001, 11100, 10110, 11101, 10011, 11110, 10111, 11111, 100000, 110000, 101000, 110001, 100100, 110010
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence written in decimal is A139706.
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 14: 14 = 1110 in binary. Rotate once to the right, getting 0111. The leftmost digit is a 0, so rotate again to the right, getting 1011. A 1 is the leftmost digit, so stop here. a(14) therefore is 1011 (which is 11 in decimal).
|
|
MATHEMATICA
|
Table[FromDigits[NestWhile[RotateRight[#]&, RotateRight[IntegerDigits[n, 2]], #[[1]] != 1&]], {n, 40}] (* Harvey P. Dale, Oct 26 2016 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|