三角形T(n,k)开始:
[0] 1
[1] 0, 1
[2] 0, 1, 1
[3] 0, 1, 4, 1
[4] 0, 1, 10, 10, 1
[5] 0, 1, 20, 50, 20, 1
[6] 0, 1, 35, 175, 175, 35, 1
[7] 0, 1, 56, 490, 980, 490, 56, 1
[8] 0, 1, 84, 1176, 4116, 4116, 1176, 84, 1
[9] 0, 1, 120, 2520, 14112, 24696, 14112, 2520, 120, 1
.
设p=(p1,p2,…,pn)表示{1,2,…,n}的置换。如果p(i)<p(i+1),则该对(p(i。此外,在p开头计算常规上升。
T(n,k)是{1,2,…,n}随k增加的Baxter置换数。例如,对于n=4,[T(n,k)对于k=0..n]=[0,1,10,10,1]。前面上升次数的排列为:
.
1 [4, 3, 2, 1], 3 [2, 3, 4, 1], 2 [3, 4, 2, 1], 3 [2, 3, 1, 4],
2 [3, 2, 4, 1], 3 [2, 1, 3, 4], 2 [3, 2, 1, 4], 3 [1, 3, 4, 2],
2 [2, 4, 3, 1], 3 [1, 3, 2, 4], 2 [4, 2, 3, 1], 3 [3, 4, 1, 2],
2 [2, 1, 4, 3], 3 [3, 1, 2, 4], 2 [4, 2, 1, 3], 3 [1, 2, 4, 3],
2 [1, 4, 3, 2], 3 [1, 4, 2, 3], 2 [4, 1, 3, 2], 3 [4, 1, 2, 3],
2 [4, 3, 1, 2], 4 [1, 2, 3, 4].