cp's OEIS Frontend

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.

A366139 In binary representation, rotate the digits of n left n places.

Original entry on oeis.org

0, 1, 2, 3, 1, 6, 6, 7, 8, 3, 10, 13, 12, 11, 11, 15, 1, 6, 20, 25, 20, 11, 26, 29, 12, 25, 21, 15, 7, 30, 30, 31, 2, 12, 40, 49, 36, 11, 26, 60, 10, 52, 42, 23, 50, 45, 43, 55, 48, 35, 11, 30, 13, 58, 54, 47, 35, 15, 46, 61, 60, 59, 59, 63, 1, 6, 20, 56, 17, 98
Offset: 0

Views

Author

Paolo Xausa, Sep 30 2023

Keywords

Examples

			a(4) = 1 because 4 in base 2 is 100 and 100 rotated left 4 times is 100 -> 001 -> 010 -> 100 -> 001 = 1.
a(5) = 6 because 5 in base 2 is 101 and 101 rotated left 5 times is 101 -> 011 -> 110 -> 101 -> 011 -> 110 = 6 in base 10.
		

Crossrefs

Cf. A006257, A007088, A366140 (fixed points).
Cf. A336953 (rotate right).

Programs

  • Mathematica
    A366139[n_]:=FromDigits[RotateLeft[IntegerDigits[n,2],n],2];
    Array[A366139,100,0]
  • Python
    def A366139(n): return int((s:=bin(n))[(m:=n%n.bit_length()+2):]+s[2:m],2) if n else 0 # Chai Wah Wu, Oct 03 2023