|
|
A263489
|
|
Triangle read by rows: T(n,k) (n>=2, 1<=k<=n!) is the number of permutations of n whose inversion arrangement contains k regions.
|
|
0
|
|
|
1, 1, 1, 2, 0, 2, 0, 1, 1, 3, 0, 5, 0, 2, 0, 4, 0, 0, 0, 4, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 1, 4, 0, 9, 0, 3, 0, 12, 0, 0, 0, 10, 0, 2, 0, 8, 0, 6, 0, 0, 0, 0, 0, 14, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 14, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 4, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1,1,
1,2,0,2,0,1,
1,3,0,5,0,2,0,4,0,0,0,4,0,1,0,0,0,3,0,0,0,0,0,1,
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|