A195665 Consecutive bit-permutations of nonnegative integers.
0, 1, 0, 2, 1, 3, 0, 1, 4, 5, 2, 3, 6, 7, 0, 2, 4, 6, 1, 3, 5, 7, 0, 4, 1, 5, 2, 6, 3, 7, 0, 4, 2, 6, 1, 5, 3, 7, 0, 1, 2, 3, 8, 9, 10, 11, 4, 5, 6, 7, 12, 13, 14, 15, 0, 2, 1, 3, 8, 10, 9, 11, 4, 6, 5, 7, 12, 14, 13, 15, 0, 1, 4, 5, 8, 9, 12
Offset: 0
Examples
Top left corner of array: 0 1 2 3 4 5 6 7 0 2 1 3 4 6 5 7 0 1 4 5 2 3 6 7 0 2 4 6 1 3 5 7 0 4 1 5 2 6 3 7 0 4 2 6 1 5 3 7 The entry in row 2, column 5 (both counted from 0) is 3: 5 in reverse binary is 101, permutation p_2 applied on 101 gives 110, 110 from reverse binary to decimal is 3. Corresponding rows of the triangle: 0 1 0 2 1 3 0 1 4 5 2 3 6 7 0 2 4 6 1 3 5 7 0 4 1 5 2 6 3 7 0 4 2 6 1 5 3 7
Links
- Tilman Piesk, First 120 rows of the triangle, flattened
- Tilman Piesk, 120x32 top left submatrix (human readable)
- Tilman Piesk, 720x64 top left submatrix (computer readable)
- Tilman Piesk, First 720 rows of the triangle
- Tilman Piesk, Bit-permutations (Wikiversity)
- Tilman Piesk, MATLAB code
Crossrefs
Extensions
Huge edit by Tilman Piesk, Aug 01 2013
Comments