99879

Appears in sequences

• Number of connected vertex-transitive graphs with n nodes.at n=42A006800
• Number of necklaces of sets of beads containing a total of n beads.at n=20A008965
• Number of connected circulant graphs on n nodes.at n=42A075545
• Number of sets of distinct positive integers whose arithmetic mean is an integer, the largest integer of the set being n.at n=20A082550
• Numbers that require exactly 8 iterations to determine that they are happy or not (A007770 and A031177).at n=24A193996
• Sum of the largest parts of the partitions of 4n into 4 parts.at n=17A239667