A054081 Array T by antidiagonals: for n >= 0 and k >= 1, let p(k)=least positive integer not already in a(i), q(k)=p(k)+k+n-1, a(p(k))=q(k), a(q(k))=p(k); then for h>=1, T(n,h)=a(h).
1, 3, 2, 2, 1, 3, 6, 5, 5, 4, 8, 7, 1, 6, 5, 4, 3, 8, 8, 7, 6, 11, 10, 2, 1, 9, 8, 7, 5, 4, 11, 11, 11, 10, 9, 8, 14, 13, 13, 2, 1, 12, 11, 10, 9, 16, 15, 4, 14, 14, 14, 13, 12, 11, 10, 7, 6, 16, 3, 2, 1, 15, 14, 13, 12, 11, 19, 18, 18, 17, 17, 17, 17, 16, 15, 14, 13, 12
Offset: 1
Examples
Row 0: 1 3 2 6 8 4 11 ... = A019444. Row 1: 2 1 5 7 3 10 4 ... = A002251. Row 2: 3 5 1 8 2 11 13 ...
Links
- Sean A. Irvine, Java program (github)
- Index entries for sequences that are permutations of the natural numbers
Extensions
More terms from Sean A. Irvine, Jan 24 2022
Comments