%N Triangle read by rows: T(n,k) = number of overlaps formed by element 1 in the set of permutations of n elements, where the element n does not occupy the k-th place after 1.
%D A. Sade, Sur les Chevauchements des Permutations, published by the author, Marseille, 1949.
%H Albert Sade, <a href="/A000108/a000108_17.pdf">Sur les Chevauchements des Permutations</a>, published by the author, Marseille, 1949. [Annotated scanned copy]
%e Triangle begins:
%Y Row sums are A259705.
%A _N. J. A. Sloane_, Jul 05 2015