

A336953


In binary representation, rotate the digits of n right n places.


3



0, 1, 2, 3, 2, 3, 6, 7, 8, 12, 10, 7, 12, 14, 11, 15, 8, 12, 10, 7, 20, 26, 21, 30, 17, 25, 13, 30, 19, 27, 30, 31, 8, 12, 10, 7, 36, 50, 41, 60, 34, 19, 42, 53, 11, 45, 58, 31, 48, 56, 44, 30, 19, 43, 54, 59, 14, 15, 43, 55, 60, 62, 47, 63, 32, 48, 40, 28
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

On the graph, there are a series of larger and larger parallelograms joined together by a straight line on y=x where n is unchanged, mostly in the case where n is a multiple of the bit length of n. In addition to the main line that cuts through the graph, each parallelogram has the same few sloped lines in its borders.


LINKS



EXAMPLE

a(3) = a('11') = '11' = 3;
a(4) = a('100') = '010' = '10' = 2;
a(5) = a('101') = '011' = '11' = 3;


MATHEMATICA

Array[FromDigits[RotateRight[IntegerDigits[#, 2], #], 2] &, 68, 0] (* Michael De Vlieger, Oct 05 2020 *)


PROG

(PARI) a(n) = my(d=binary(n)); for (k=1, n, d = concat(d[#d], d[1..#d1])); fromdigits(d, 2); \\ Michel Marcus, Aug 09 2020
(Python)
if n == 0: return 0
l, m = (n%n.bit_length()), bin(n)[2:]


CROSSREFS



KEYWORD



AUTHOR



STATUS

approved



