29770

Appears in sequences

• Number of binary strings of length n with equal numbers of 0010 and 1001 substrings.at n=16A164169
• Number of nX5 0..2 arrays with exactly floor(nX5/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=3A222687
• T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=31A222690
• Number of 4Xn 0..2 arrays with exactly floor(4Xn/2) elements unequal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order.at n=4A222693
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 374", based on the 5-celled von Neumann neighborhood.at n=29A287908
• Number of 5Xn 0..1 arrays with every element equal to 0, 2, 3 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=7A302463
• a(n) = 5*(n+1)*(9*n+4).at n=25A304507
• Number of ways to write n as an ordered sum of 10 nonzero tetrahedral numbers.at n=55A341809
• Number of twice-partitions of n into partitions with all odd lengths and sums.at n=23A358827
• Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 4*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x^2.at n=40A367209