99878

Appears in sequences

• A simple grammar: cycles of pairs of sequences.at n=21A052823
• Number of connected unlabeled vertex-transitive graphs with n nodes such that complement is also connected.at n=42A054917
• Number of n-bead necklaces using exactly three colors with no adjacent beads having the same color.at n=20A093367
• Number of necklaces with n beads of 3 colors, no 2 adjacent beads the same color.at n=20A106365
• Triangle read by rows: T(n,k) is the number of non-isomorphic colorings of a toroidal n X k grid using exactly two colors under translational symmetry, 1 <= k <= n.at n=23A294684