37311

Appears in sequences

• Number of partitions satisfying 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(0,5) + cn(1,5) + cn(4,5) + cn(3,5).at n=40A039904
• Number of zero-sum nX2 -1..1 arrays with every element unequal to at most two horizontal and vertical neighbors.at n=6A202041
• Number of zero-sum nX7 -1..1 arrays with every element unequal to at most two horizontal and vertical neighbors.at n=1A202046
• T(n,k)=Number of zero-sum nXk -1..1 arrays with every element unequal to at most two horizontal and vertical neighbors.at n=29A202047
• T(n,k)=Number of zero-sum nXk -1..1 arrays with every element unequal to at most two horizontal and vertical neighbors.at n=34A202047
• Triangle read by rows: T(n,k) is the number of unsensed combinatorial maps with n edges and k vertices, 1 <= k <= n + 1.at n=41A380616