18646

Appears in sequences

• One half of number of non-self-conjugate partitions; also half of number of asymmetric Ferrers graphs with n nodes.at n=40A000701
• Number of partitions of n into an odd number of parts.at n=40A027193
• Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 101-111-101 pattern in any orientation.at n=16A146435
• Number of n-bead necklaces labeled with numbers -4..4 allowing reversal, with sum zero with no three beads in a row equal.at n=6A209340
• T(n,k) is the number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero with no three beads in a row equal.at n=51A209344
• Number of 7-bead necklaces labeled with numbers -n..n allowing reversal, with sum zero with no three beads in a row equal.at n=3A209348
• Number of partitions of 2n of type EO (see Comments).at n=20A236559
• G.f. satisfies: A(x) = Sum_{n>=0} (A(x)^n + 2)^n * x^n / (1+2*x)^(n+1).at n=7A251180
• Number of length 3 1..(n+2) arrays with no leading partial sum equal to a prime.at n=33A254541
• Partial sums of A255745.at n=21A255766
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 205", based on the 5-celled von Neumann neighborhood.at n=29A270731
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 233", based on the 5-celled von Neumann neighborhood.at n=29A270978
• Number of integer partitions of n with reverse-alternating product > 1.at n=40A347449