188835

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, -1), (0, 1, 1), (1, -1, 1), (1, 1, 0)}.at n=9A150533
• Number of horizontal, vertical and diagonal neighbor colorings of the even squares of an nX3 array with new integer colors introduced in row major order.at n=7A215954
• T(n,k)=Number of horizontal, vertical and diagonal neighbor colorings of the even squares of an nXk array with new integer colors introduced in row major order.at n=47A215959
• T(n,k)=Number of horizontal, vertical and diagonal neighbor colorings of the even squares of an nXk array with new integer colors introduced in row major order.at n=52A215959
• Number of horizontal, vertical and diagonal neighbor colorings of the odd squares of an nX3 array with new integer colors introduced in row major order.at n=7A216026
• T(n,k) is the number of horizontal, vertical and diagonal neighbor colorings of the odd squares of an n X k array with new integer colors introduced in row major order.at n=47A216031
• T(n,k) is the number of horizontal, vertical and diagonal neighbor colorings of the odd squares of an n X k array with new integer colors introduced in row major order.at n=52A216031
• Number of nX2 0..1 arrays with every row and column least squares fitting to a nonnegative slope straight line, with a single point array taken as having zero slope.at n=11A222856
• Number of partitions of subsets of {1,...,n}, where consecutive integers are required to be in different parts.at n=10A261041