19232

Appears in sequences

• Number of bicoverings of an n-set.at n=6A002718
• Number of fountains of n coins.at n=20A005169
• a(n) = diagonal sum of left-justified array T given by A027052.at n=28A027069
• Susceptibility series H_3 for 2-dimensional Ising model (divided by 2).at n=16A054410
• Number of partitions of the n-th prime into parts that are all primes.at n=23A056768
• Let N = 235711171923293137..., the concatenation of the primes. a(n) is the n-digit number formed from the digits of N starting from the {n(n-1)/2 +1}th digit. Omit any leading zeros.at n=4A066549
• Number of binary strings of length n with equal numbers of 0001 and 1001 substrings.at n=16A164162
• Number of binary strings of length n with equal numbers of 0101 and 1010 substrings.at n=15A164176
• T(n,k) is the number of (n*k) X k binary arrays with nonzero rows in decreasing order and n ones in every column.at n=22A188445
• Number of n-bead necklaces labeled with numbers -1..1 allowing reversal, with sum zero with no three beads in a row equal.at n=14A209337
• Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=5A252531
• Number of (6+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=6A252538
• Rainbow Squares: a(n) = number of ways to pair the integers 1 to 2n so that the sum of each pair is a square.at n=23A252897
• Number of (n+2)X(3+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 or 00000101.at n=11A259767
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 397", based on the 5-celled von Neumann neighborhood.at n=30A271691
• Digits of the Copeland-Erdős constant taken in groups of five digits.at n=10A304652
• Sum of the squarefree parts of the partitions of n into 10 parts.at n=32A309486
• Number of n-regular hypergraphs on 6 labeled vertices.at n=2A331129
• Number of ways to choose a divisor with distinct prime exponents of a divisor with distinct prime exponents of n!.at n=13A336425
• Expansion of g.f. A(x) satisfying A(x) = 1 + x*(5*A(x)^2 - A(-x)^2)/4.at n=9A369083