This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054081 Array T by antidiagonals: for n >= 0 and k >= 1, let p(k)=least number in N not already an 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). 0
 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 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Each row is a self-inverse permutation of N; are the numbers in every column distinct? LINKS 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: A204257 A074976 A068448 * A164585 A200996 A154364 Adjacent sequences:  A054078 A054079 A054080 * A054082 A054083 A054084 KEYWORD nonn,tabl,eigen AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 18:27 EST 2019. Contains 319250 sequences. (Running on oeis4.)