|
%I #12 Oct 01 2015 18:17:43
%S 1,2,2,1,3,1,3,1,1,3,2,1,4,2,1,4,2,1,1,4,3,1,1,4,3,2,1,5,3,2,1,5,3,2,
%T 1,1,5,4,2,1,1,6,4,2,1,1,5,4,3,2,1,6,4,3,2,1,6,4,3,2,1,1,7,4,3,2,1,1,
%U 7,5,3,2,1,1,7,5,3,2,2,1,7,5,3,2,2,1,1,7,5,4,3,2,1,7,5,4,3,2,1
%N Triangle read by rows in which row n gives the partition of n associated with highest degree representation of symmetric group S_n.
%C Note that a partition and its conjugate give the same degree representation of the symmetric group. We take the lexicographically earlier of the two.
%H J. McKay, <a href="http://dx.doi.org/10.1090/S0025-5718-1976-0404414-X">The largest degrees of irreducible characters of the symmetric group</a>. Math. Comp. 30 (1976), no. 135, 624-631. (Gives first 75 rows on pp. 627-629.)
%H J. McKay, <a href="/A003040/a003040a.jpg">Page 1 of 5 pages of tables from Math. Comp. paper</a>
%H J. McKay, <a href="/A003040/a003040b.jpg">Page 2 of 5 pages of tables from Math. Comp. paper</a>
%H J. McKay, <a href="/A003040/a003040c.jpg">Page 3 of 5 pages of tables from Math. Comp. paper</a>
%H J. McKay, <a href="/A003040/a003040d.jpg">Page 4 of 5 pages of tables from Math. Comp. paper</a>
%H J. McKay, <a href="/A003040/a003040e.jpg">Page 5 of 5 pages of tables from Math. Comp. paper</a>
%F If p_1 >= p_2 >= ... >= p_k is the partition of n, the degree of the representation (given in A003040) is n! * Product_{i<j} (b_i - b_j) / Product_i (b_i!), where b_i = p_i+k-i.
%e Triangle begins:
%e 1
%e 2
%e 2 1
%e 3 1
%e 3 1 1
%e 3 2 1
%e 4 2 1
%e 4 2 1 1
%e 4 3 1 1
%e 4 3 2 1
%e 5 3 2 1
%e 5 3 2 1 1
%e 5 4 2 1 1
%e 6 4 2 1 1
%e 5 4 3 2 1
%e 6 4 3 2 1
%e 6 4 3 2 1 1
%e 7 4 3 2 1 1
%e 7 5 3 2 1 1
%e 7 5 3 2 2 1
%e 7 5 3 2 2 1 1
%e 7 5 4 3 2 1
%e 7 5 4 3 2 1 1
%e 8 5 4 3 2 1 1
%e 8 6 4 3 2 1 1
%Y See A003040 for much more information. Cf. A060240.
%K nonn,tabf
%O 1,2
%A _N. J. A. Sloane_, Apr 28 2006
|
