This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A336953 #43 Oct 03 2023 13:14:51 %S A336953 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, %T A336953 30,19,27,30,31,8,12,10,7,36,50,41,60,34,19,42,53,11,45,58,31,48,56, %U A336953 44,30,19,43,54,59,14,15,43,55,60,62,47,63,32,48,40,28 %N A336953 In binary representation, rotate the digits of n right n places. %C A336953 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. %H A336953 Rémy Sigrist, <a href="/A336953/b336953.txt">Table of n, a(n) for n = 0..16384</a> %e A336953 a(3) = a('11') = '11' = 3; %e A336953 a(4) = a('100') = '010' = '10' = 2; %e A336953 a(5) = a('101') = '011' = '11' = 3; %t A336953 Array[FromDigits[RotateRight[IntegerDigits[#, 2], #], 2] &, 68, 0] (* _Michael De Vlieger_, Oct 05 2020 *) %o A336953 (PARI) a(n) = my(d=binary(n)); for (k=1, n, d = concat(d[#d], d[1..#d-1])); fromdigits(d, 2); \\ _Michel Marcus_, Aug 09 2020 %o A336953 (Python) %o A336953 def A336953(n): %o A336953 if n == 0: return 0 %o A336953 l, m = -(n%n.bit_length()), bin(n)[2:] %o A336953 return int(m[l:]+m[:l],2) # _Chai Wah Wu_, Jan 22 2023 %Y A336953 Cf. A007088, A038572 (rotated one binary place to the right). %Y A336953 Cf. A366139 (rotate left), A366140 (fixed points). %K A336953 nonn,base,look %O A336953 0,3 %A A336953 _Gage Schacher_, Aug 08 2020