263232

Appears in sequences

• Number of n X n arrays of squares of integers with every (n-1)X(n-1) subblock summing to 28.at n=1A159422
• Number of nX4 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors, with the exception of exactly one element.at n=4A283199
• Number of nX5 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors, with the exception of exactly one element.at n=3A283200
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors, with the exception of exactly one element.at n=31A283203
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than two of its horizontal and vertical neighbors, with the exception of exactly one element.at n=32A283203
• Least k such that there are exactly n ways to choose a set consisting of a different binary index of each binary index of k.at n=10A368184