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,2

Comments

Each row is a self-inverse permutation of N; are the numbers in every column distinct?

Links

Table of n, a(n) for n=1..78.

Sean A. Irvine, Java program (github)

Index entries for sequences that are permutations of the natural numbers

Example

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 ...

Crossrefs

Sequence in context: A074976 A329873 A068448 * A164585 A200996 A154364

Adjacent sequences: A054078 A054079 A054080 * A054082 A054083 A054084

Keyword

nonn,tabl,eigen

Author

Clark Kimberling

Extensions

More terms from Sean A. Irvine, Jan 24 2022

Status

approved