login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A259704
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.
1
0, 0, 0, 1, 0, 1, 2, 2, 2, 2, 20, 14, 12, 14, 20, 80, 80, 80, 80, 80, 80, 840, 720, 648, 624, 648, 720, 840
OFFSET
2,7
REFERENCES
A. Sade, Sur les Chevauchements des Permutations, published by the author, Marseille, 1949.
LINKS
Albert Sade, Sur les Chevauchements des Permutations, published by the author, Marseille, 1949. [Annotated scanned copy]
EXAMPLE
Triangle begins:
0,
0,0,
1,0,1,
2,2,2,2,
20,14,12,14,20,
80,80,80,80,80,80,
840,720,648,624,648,720,840,
...
CROSSREFS
Row sums are A259705.
Sequence in context: A029643 A100687 A067096 * A249779 A167394 A029627
KEYWORD
nonn,tabl,more
AUTHOR
N. J. A. Sloane, Jul 05 2015
STATUS
approved