A239304 Triangle of permutations corresponding to the compressed square roots of Gray code * bit-reversal permutation (A239303).
1, 1, 2, 3, 1, 2, 4, 2, 1, 3, 2, 5, 4, 1, 3, 2, 5, 6, 3, 1, 4, 6, 2, 3, 7, 5, 1, 4, 7, 3, 2, 6, 8, 4, 1, 5, 3, 8, 7, 2, 4, 9, 6, 1, 5, 3, 8, 9, 4, 2, 7, 10, 5, 1, 6, 9, 3, 4, 10, 8, 2, 5, 11, 7, 1, 6, 10, 4, 3, 9
Offset: 1
Examples
Triangular array begins: 1 1 2 3 1 2 4 2 1 3 2 5 4 1 3 2 5 6 3 1 4 Square array begins: 1 1 3 4 2 2 2 1 2 5 5 2 2 1 4 6 3 2 3 1 3 7 6 2 3 1 5 8 4 2 4 1 4 9 7 2 Row 5 of A239303 is the vector (12,18,1,17,10), which corresponds to the following binary matrix: 0 0 1 1 0 0 1 0 0 1 1 0 0 0 0 1 0 0 0 1 0 1 0 1 0 Interpreted as an adjacency matrix it describes the following graph, where each number is connected to its neighbors, and only the 2 is connected to itself: 2 5 4 1 3 This is row 5 of the triangular array.
Links
- Tilman Piesk, First 140 rows of the triangle, flattened
- Tilman Piesk, Sequency ordered Walsh matrix (Wikiversity)
- Tilman Piesk, Calculation in MATLAB
Comments