|
EXAMPLE
|
Triangle begins:
k=0 1 2 3 4 5 6 7 8 9 10 11 12
n=0: 1;
n=1: 1;
n=2: 3, 0, 1;
n=3: 14, 0, 8, 10, 2, 2;
n=4: 81, 0, 59, 162, 70, 66, 82, 22, 19, 6, 7, 0, 2;
...
Row n = 3 counts the following k-crossing partitions.
T(3,0) = 14: T(3,2) = 8: T(3,3) = 10: T(3,4) = 2: T(3,5) = 2:
(1,2,3,4,5,6) (3,4,1,6,5,2) (1,2,5,6,3,4) (3,2,5,6,1,4) (3,6,1,4,5,2)
(1,2,3,6,5,4) (3,4,5,6,1,2) (1,4,3,6,5,2) (3,6,1,2,5,4) (5,2,3,6,1,4)
(1,2,5,4,3,6) (3,6,5,4,1,2) (1,4,5,2,3,6)
(1,4,3,2,5,6) (5,2,1,6,3,4) (1,6,3,2,5,4)
(1,4,5,6,3,2) (5,4,3,6,1,2) (3,2,5,4,1,6)
(1,6,3,4,5,2) (5,6,1,2,3,4) (3,4,1,2,5,6)
(1,6,5,2,3,4) (5,6,1,4,3,2) (3,6,5,2,1,4)
(1,6,5,4,3,2) (5,6,3,2,1,4) (5,2,1,4,3,6)
(3,2,1,4,5,6) (5,4,1,6,3,2)
(3,2,1,6,5,4) (5,6,3,4,1,2)
(3,4,5,2,1,6)
(5,2,3,4,1,6)
(5,4,1,2,3,6)
(5,4,3,2,1,6)
|