A368053 Array read by descending antidiagonals, where row n=0 lists the natural numbers. Each new row n=1,2,... is found by taking the number n in the previous row and "leaping" it over the next n terms to its right, while reversing the order of the skipped terms. (see example).
1, 2, 2, 3, 1, 3, 4, 3, 1, 4, 5, 4, 2, 2, 5, 6, 5, 4, 1, 3, 6, 7, 6, 5, 3, 1, 4, 7, 8, 7, 6, 5, 2, 2, 5, 8, 9, 8, 7, 6, 4, 1, 3, 6, 9, 10, 9, 8, 7, 6, 3, 1, 4, 7, 10, 11, 10, 9, 8, 7, 5, 2, 2, 5, 8, 11, 12, 11, 10, 9, 8, 7, 4, 1, 3, 6, 9, 12, 13, 12, 11, 10, 9, 8, 6, 3, 1, 4, 7, 10, 13
Offset: 1
Examples
The array begins: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, ... 2, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, ... 3, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, ... 4, 2, 1, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, ... 5, 3, 1, 2, 4, 6, 7, 8, 9, 10, 11, 12, 13, ... 6, 4, 2, 1, 3, 5, 7, 8, 9, 10, 11, 12, 13, ... 7, 5, 3, 1, 2, 4, 6, 8, 9, 10, 11, 12, 13, ... 8, 6, 4, 2, 1, 3, 5, 7, 9, 10, 11, 12, 13, ... 9, 7, 5, 3, 1, 2, 4, 6, 8, 10, 11, 12, 13, ... 10, 8, 6, 4, 2, 1, 3, 5, 7, 9, 11, 12, 13, ... 11, 9, 7, 5, 3, 1, 2, 4, 6, 8, 10, 12, 13, ... 12, 10, 8, 6, 4, 2, 1, 3, 5, 7, 9, 11, 13, ... 13, 11, 9, 7, 5, 3, 1, 2, 4, 6, 8, 10, 12, ... ...