22118

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, 0), (-1, 0, 0), (-1, 1, -1), (0, -1, 1), (1, 1, 0)}.at n=9A149174
• Number of planar n X n X n binary triangular grids with no more than 6 ones in any 4 X 4 X 4 subtriangle.at n=5A153531
• Number of size n nonnegative integer arrays with new values introduced in increasing order from 0, and no 6 consecutive elements totalling n or more.at n=9A193061
• Number of (n+2) X 5 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=5A202527
• Number of (n+2) X 8 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=2A202530
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=30A202532
• T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=33A202532
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood.at n=31A270327
• a(n) is the smallest positive integer which can be represented as the sum of distinct nonzero icosahedral numbers in exactly n ways, or -1 if no such integer exists.at n=18A360215
• Number of distinct possible binary ranks of integer partitions of n, where the binary rank of a partition y is given by Sum_i 2^(y_i-1).at n=50A373120