|
EXAMPLE
|
Triangle begins:
1,
1, 1,
2, 1, 1,
2, 2, 1, 1,
4, 3, 2, 1, 1,
5, 4, 3, 2, 1, 1,
8, 6, 5, 3, 2, 1, 1,
10, 9, 6, 5, 3, 2, 1, 1,
...
If we include negative values of the rank k, we get the following table, taken from Dyson (1969):
n\k| -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6
---+---------------------------------------------------
0 | 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, ...
1 | 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, ...
2 | 2, 2, 2, 2, 2, 2, 1, 1, 0, 0, 0, 0, 0, ...
3 | 3, 3, 3, 3, 3, 2, 2, 1, 1, 0, 0, 0, 0, ...
4 | 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 0, 0, 0, ...
5 | 7, 7, 7, 6, 6, 5, 4, 3, 2, 1, 1, 0, 0, ...
6 | 11, 11, 10, 10, 9, 8, 6, 5, 3, 2, 1, 1, 0, ...
7 | 15, 14, 14, 13, 12, 10, 9, 6, 5, 3, 2, 1, 1, ...
...
Starting at column k=-1 gives the present triangle.
|