194810

Appears in sequences

• Number of nonseparable tree-rooted planar maps with n + 2 edges and 3 vertices.at n=19A006411
• Number of n-bead necklace structures using exactly four different colored beads.at n=12A056297
• Number of primitive (period n) n-bead necklace structures using exactly four different colored beads.at n=12A056305
• Decimal representation of the n-th iteration of the "Rule 109" elementary cellular automaton starting with a single ON (black) cell.at n=9A267207
• Number of integer-sided hexagons having perimeter n, modulo rotations but not reflections.at n=41A293823
• Number of n-bead necklace structures which are not self-equivalent under a nonzero rotation using exactly four different colored beads.at n=12A328741
• a(n) is the number of subsets of {1..n} that contain exactly 4 odd and 1 even numbers.at n=45A333320