login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060369 a(n) is the maximum number of occurrences of a degree in the sequence of the degrees of the irreducible representations of the symmetric group S_n. 2
1, 2, 2, 2, 2, 4, 4, 2, 3, 2, 4, 4, 6, 6, 6, 4, 8, 6, 10, 6, 8, 8, 12, 8, 12, 12, 10, 12, 22, 14, 12, 12, 16, 18, 30, 14, 20, 26, 16, 20, 22, 20, 26, 25, 24, 24, 32, 16, 32, 30, 26, 24, 32, 32, 40, 32, 34, 32, 32, 34, 44, 30, 44, 36, 52, 34, 54, 38, 56, 50 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(6) = 4 because the degrees for S_6 are 1,1,5,5,5,5,9,9,10,10,16 and the number 5 appears 4 times.
PROG
(Sage)
def A060369(n) :
mult = {}
for P in Partitions(n):
dim = P.dimension()
mult[dim] = mult.get(dim, 0) + 1
return max(mult.values())
# Eric M. Schmidt, May 01 2013
CROSSREFS
Sequence in context: A007457 A119802 A237120 * A179004 A143979 A034877
KEYWORD
nonn
AUTHOR
Avi Peretz (njk(AT)netvision.net.il), Apr 01 2001
EXTENSIONS
More terms from Eric M. Schmidt, May 01 2013
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)