A282510 Irregular triangle T(n,k) read by rows: Each term is the least positive integer such that no row, column, diagonal, or antidiagonal contains a repeated term; and each row terminates at k when it contains all numbers <= k.
1, 2, 3, 1, 4, 5, 2, 3, 1, 3, 1, 4, 5, 2, 5, 2, 3, 1, 4, 6, 4, 5, 2, 3, 7, 8, 9, 1, 7, 8, 6, 4, 5, 9, 10, 11, 2, 3, 1, 9, 10, 7, 8, 6, 11, 12, 13, 4, 5, 2, 3, 1, 8, 6, 9, 10, 7, 13, 14, 15, 11, 12, 4, 5, 2, 3, 1, 10, 11, 12, 6, 9, 1, 7, 8, 13, 14, 15, 16, 4, 5, 2, 3
Offset: 1
Examples
Triangle begins: : 1 : 2 3 1 : 4 5 2 3 1 : 3 1 4 5 2 : 5 2 3 1 4 : 6 4 5 2 3 7 8 9 1 : 7 8 6 4 5 9 10 11 2 3 1 : 9 10 7 8 6 11 12 13 4 5 2 3 1 : 8 6 9 10 7 13 14 15 11 12 4 5 2 3 1 : 10 11 12 6 9 1 7 8 13 14 15 16 4 5 2 3 : 12 7 13 14 8 2 3 1 6 10 9 17 11 15 4 5 16
Links
- Alois P. Heinz, Rows n = 1..160, flattened
Crossrefs
Cf. A274651.
Comments