This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A117500 Triangle read by rows in which row n gives the partition of n associated with highest degree representation of symmetric group S_n. 2
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Note that a partition and its conjugate give the same degree representation of the symmetric group. We take the lexicographically earlier of the two. LINKS J. McKay, The largest degrees of irreducible characters of the symmetric group. Math. Comp. 30 (1976), no. 135, 624-631. (Gives first 75 rows on pp. 627-629.) FORMULA If p_1 >= p_2 >= ... >= p_k is the partition of n, the degree of the representation (given in A003040) is n! * Product_{i

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 19 16:18 EDT 2019. Contains 322282 sequences. (Running on oeis4.)