This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A195663 #51 Feb 17 2019 05:36:41
%S A195663 1,2,2,3,1,1,4,3,3,3,5,4,2,1,2,6,5,4,2,3,3,7,6,5,4,1,2,1,8,7,6,5,4,1,
%T A195663 2,2,9,8,7,6,5,4,4,1,1,10,9,8,7,6,5,3,4,4,4,11,10,9,8,7,6,5,3,2,1,2,
%U A195663 12,11,10,9,8,7,6,5,3,2,4,4,13,12,11,10,9,8,7,6,5,3,1,2,1,14,13,12,11,10,9,8,7,6,5,3,1,3,3
%N A195663 Array read by antidiagonals: Consecutive finite permutations of positive integers in reverse colexicographic order.
%C A195663 Row n is the n-th finite permutation of {1,2,3,4,...}.
%H A195663 Tilman Piesk, <a href="/A195663/b195663.txt">Table of n, a(n) for n = 0..7259</a>
%H A195663 Tilman Piesk, <a href="http://commons.wikimedia.org/wiki/File:Symmetric_group_4;_permutation_list_with_matrices.svg">Detailed table of the 24 permutations of 1...4</a>
%H A195663 Tilman Piesk, <a href="/A198380/a198380_1.txt">Table of the 40320 permutations of 1...8</a>, a supporting file of A198380
%H A195663 OEIS-Wiki, <a href="http://oeis.org/wiki/Orderings">Orderings</a> section <a href="http://oeis.org/wiki/Orderings#Reverse_colexicographic_order">rev colex</a>
%H A195663 Tilman Piesk, <a href="/A195663/a195663.txt">MATLAB code</a> used for the calculation
%F A195663 a(n) = A195664(n)+1.
%e A195663 The first 24 permutations of positive integers in rev colex order:
%e A195663 00 --> 1 2 3 4 5 6 7 8 ...
%e A195663 01 --> 2 1 3 4 ...
%e A195663 02 --> 1 3 2 4 ...
%e A195663 03 --> 3 1 2 4 ...
%e A195663 04 --> 2 3 1 4 ...
%e A195663 05 --> 3 2 1 4 ...
%e A195663 06 --> 1 2 4 3 ...
%e A195663 07 --> 2 1 4 3 ...
%e A195663 08 --> 1 4 2 3 ...
%e A195663 09 --> 4 1 2 3 ...
%e A195663 10 --> 2 4 1 3 ...
%e A195663 11 --> 4 2 1 3 ...
%e A195663 12 --> 1 3 4 2 ...
%e A195663 13 --> 3 1 4 2 ...
%e A195663 14 --> 1 4 3 2 ...
%e A195663 15 --> 4 1 3 2 ...
%e A195663 16 --> 3 4 1 2 ...
%e A195663 17 --> 4 3 1 2 ...
%e A195663 18 --> 2 3 4 1 ...
%e A195663 19 --> 3 2 4 1 ...
%e A195663 20 --> 2 4 3 1 ...
%e A195663 21 --> 4 2 3 1 ...
%e A195663 22 --> 3 4 2 1 ...
%e A195663 23 --> 4 3 2 1 ...
%Y A195663 Cf. A055089 (a very compact representation of these permutations).
%Y A195663 Cf. A195664 (same for nonnegative integers, so all entries are smaller by 1).
%K A195663 nonn,tabl
%O A195663 0,2
%A A195663 _Tilman Piesk_, Sep 22 2011