login
A370666
Triangle read by rows: T(n, m) is the number of standard Young tableaux with n boxes and major index equivalent to m modulo n.
0
1, 1, 1, 2, 1, 1, 3, 2, 3, 2, 6, 5, 5, 5, 5, 14, 12, 12, 14, 12, 12, 34, 33, 33, 33, 33, 33, 33, 98, 94, 96, 94, 98, 94, 96, 94, 294, 290, 290, 293, 290, 290, 293, 290, 290, 952, 949, 949, 949, 949, 952, 949, 949, 949, 949, 3246, 3245, 3245, 3245, 3245, 3245
OFFSET
1,4
LINKS
Richard P. Stanley, Bijective Proof Problems, Massachusetts Institute of Technology, 2009. See problem 219 on page 54.
EXAMPLE
The triangle T(n,m) begins:
n\m 0 1 2 3 4 5 6 7 8 9
1: 1
2: 1 1
3: 2 1 1
4: 3 2 3 2
5: 6 5 5 5 5
6: 14 12 12 14 12 12
7: 34 33 33 33 33 33 33
8: 98 94 96 94 98 94 96 94
9: 294 290 290 293 290 290 293 290 290
10: 952 949 949 949 949 952 949 949 949 949
T(6,3)=12 because there are 12 standard Young tableaux with 6 boxes and a major index equivalent to 3 modulo 6.
CROSSREFS
Row sums are A000085.
Sequence in context: A196526 A234504 A112592 * A351466 A070036 A059779
KEYWORD
nonn,tabl
AUTHOR
STATUS
approved