“…If n ≡ 0 (mod 4), a similar argument shows that the cases n = 4, 8, 12 cannot occur since µ = [7,5,3,1] is the least partition that can be written as a sum of at least four odd pairwise different numbers. If n = 9, then there exist only two partitions which satisfy the first two conditions of Theorem 4.5, namely [5,3,1] and [9]. The partition [5,3,1] does not satisfy the third condition, and [9] does not satisfy the fourth one.…”