A375001 Square array read by antidiagonals: T(n,k) is the position of the last requested element when the elements of the k-th composition (in standard order) are requested from a self-organizing list initialized to (1, 2, 3, ...), using the move-ahead(n) updating strategy; n >= 0, k >= 1.
1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 1, 3, 1, 2, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 3, 1, 2, 1, 4, 1, 2, 2, 3, 1, 2, 1, 1, 4, 1, 2, 2, 3, 1, 2, 1, 2, 1, 4, 1, 2, 2, 3, 1, 2, 1, 1, 1, 2, 4, 1, 2, 2, 3, 1, 2, 1, 3, 1, 1, 2, 4, 1, 2, 2, 3, 1, 2, 1, 1, 3, 1, 1, 2, 4, 1, 2, 2, 3, 1, 2, 1
Offset: 0
Examples
Array begins: n\k| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 ---+-------------------------------------------- 0 | 1 2 1 3 1 2 1 4 1 2 1 3 1 2 1 1 | 1 2 1 3 2 2 1 4 1 1 1 3 2 2 1 2 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 3 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 4 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 5 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 6 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 7 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 8 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 9 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 10 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 11 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 12 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 13 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 14 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1 15 | 1 2 1 3 2 2 1 4 2 1 1 3 2 2 1
Comments