58990

Appears in sequences

• Triangle read by rows: T(n,k) is the number of inequivalent colorings of lone-child-avoiding rooted trees with n colored leaves using exactly k colors.at n=31A339645
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero dodecahedral numbers in exactly n ways, or -1 if no such integer exists.at n=20A360216