|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,7
|
|
REFERENCES
|
A. Sade, Sur les Chevauchements des Permutations, published by the author, Marseille, 1949.
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|