A227189 Square array A(n>=0,k>=0) where A(n,k) gives the (k+1)-th part of the unordered partition which has been encoded in the binary expansion of n, as explained in A227183. The array is scanned antidiagonally as A(0,0), A(0,1), A(1,0), A(0,2), A(1,1), etc.
0, 0, 1, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 2, 3, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 3, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2
Offset: 0
Examples
The top-left corner of the array: row # row starts as 0 0, 0, 0, 0, 0, ... 1 1, 0, 0, 0, 0, ... 2 1, 1, 0, 0, 0, ... 3 2, 0, 0, 0, 0, ... 4 2, 2, 0, 0, 0, ... 5 1, 1, 1, 0, 0, ... 6 1, 2, 0, 0, 0, ... 7 3, 0, 0, 0, 0, ... 8 3, 3, 0, 0, 0, ... 9 1, 2, 2, 0, 0, ... 10 1, 1, 1, 1, 0, ... 11 2, 2, 2, 0, 0, ... 12 2, 3, 0, 0, 0, ... 13 1, 1, 2, 0, 0, ... 14 1, 3, 0, 0, 0, ... 15 4, 0, 0, 0, 0, ... 16 4, 4, 0, 0, 0, ... 17 1, 3, 3, 0, 0, ... etc. 8 has binary expansion "1000", whose runlengths are [3,1] (the length of the run in the least significant end comes first) which maps to nonordered partition {3+3} as explained in A227183, thus row 8 begins as 3, 3, 0, 0, ... 17 has binary expansion "10001", whose runlengths are [1,3,1] which maps to nonordered partition {1,3,3}, thus row 17 begins as 1, 3, 3, ...
Comments