22870

Appears in sequences

• Shifts left under "DIJ" (bracelet, indistinct, labeled) transform, with a(1)=2.at n=6A032272
• Starting from generation 8 add previous and next term yielding generation 9.at n=23A048455
• Number of (n+1) X (2+1) 0..2 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with upper left element zero.at n=2A231139
• Number of (n+1)X(3+1) 0..2 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with upper left element zero.at n=1A231140
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with upper left element zero.at n=7A231144
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with upper left element zero.at n=8A231144
• Number of partitions of n with difference 10 between the number of odd parts and the number of even parts, both counted without multiplicity.at n=38A242701
• Number of gap-free but not complete compositions of n.at n=25A251729
• The number of overpartitions of n with restricted odd differences and smallest part both odd and overlined.at n=32A261037
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 371", based on the 5-celled von Neumann neighborhood.at n=31A271456
• Consider the figure made up of a row of n adjacent congruent rectangles, with diagonals of all possible rectangles drawn; a(n) is the number of interior vertices where exactly four lines cross.at n=47A336490
• a(n) = 1 + Sum_{k=1..n-5} a(k) * a(n-k-5).at n=32A346077
• Number of integer partitions of n containing three parts (a,b,c) (repeats allowed) such that a + b = c. A variation of sum-full partitions.at n=38A363225