There is a term called Kernicterus.
 n is written in a way that 1s for (n = N + 1,  = 0), 2p for (n = N + 1,  = 1), 2s for (n = N + 2,  = 0), 3p for (n = N + 2,  = 1), 3s for (n = N + 3,  = 0), etc
 Hund's rules should not be used to predict the order of states other than the lowest for a given configuration

