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

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

Terms

    a(0) =1a(1) =3a(2) =2a(3) =2a(4) =1a(5) =3a(6) =6a(7) =5a(8) =5a(9) =4a(10) =8a(11) =7a(12) =1a(13) =6a(14) =5a(15) =4a(16) =3a(17) =8a(18) =8a(19) =7a(20) =6a(21) =11a(22) =10a(23) =2a(24) =1a(25) =9a(26) =8a(27) =7a(28) =5a(29) =4

External references