|
| |
|
|
A060437
|
|
a(n) is the number of different degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n, i.e. count each degree only once.
|
|
3
| |
|
|
1, 1, 2, 3, 4, 5, 7, 12, 15, 22, 28, 38, 45, 52, 81, 107, 130, 179, 194, 280, 348
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| The total number of irreducible representations of S_n is the partition function p(n) (sequence A000041) - this is the total number of the degrees counting multiplicities.
Also a(n) = number of distinct values of A153452(m) when A056239(m) is equal to n. - Naohiro Nomoto, Dec 31 2008
|
|
|
EXAMPLE
| a(6) = 5 because the degrees for S_6 are 1,1,5,5,5,5,9,9,10,10,16 and counting each degree only once only 5 numbers remain: 1,5,9,10,16.
|
|
|
CROSSREFS
| Cf. A000041, A060240.
Sequence in context: A143284 A015856 A174165 * A133428 A090703 A137357
Adjacent sequences: A060434 A060435 A060436 * A060438 A060439 A060440
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Avi Peretz (njk(AT)netvision.net.il), Apr 07 2001
|
|
|
EXTENSIONS
| More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), May 20 2003
|
| |
|
|
