cp's OEIS Frontend

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

%I A054081 #13 Jan 24 2022 03:52:53
%S A054081 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,
%T A054081 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,
%U A054081 16,3,2,1,15,14,13,12,11,19,18,18,17,17,17,17,16,15,14,13,12
%N 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).
%C A054081 Each row is a self-inverse permutation of N; are the numbers in every column distinct?
%H A054081 Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a054/A054081.java">Java program</a> (github)
%H A054081 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e A054081 Row 0: 1 3 2 6 8 4 11 ... = A019444.
%e A054081 Row 1: 2 1 5 7 3 10 4 ... = A002251.
%e A054081 Row 2: 3 5 1 8 2 11 13 ...
%K A054081 nonn,tabl,eigen
%O A054081 1,2
%A A054081 _Clark Kimberling_
%E A054081 More terms from _Sean A. Irvine_, Jan 24 2022