Does anyone know of an efficient way to find all self conjugates of a partition n? I know that I could guess and check using Ferrers Diagrams and following some basic rules (same number of rows as number as magnitude of first number in partition) and what not but does anyone have a better method?
Also, could you give some examples, like n = 15 and n = 16? Thanks in advance.