350352

Appears in sequences

• If X_1,...,X_n is a partition of a 3n-set X into 3-blocks then a(n) is equal to the number of permutations f of X such that f(X_i) <> X_i, (i=1,...,n).at n=2A116219
• 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, 0, 0), (0, 0, 1), (1, -1, -1), (1, 1, -1)}.at n=12A148357
• Number of nX4 0..1 arrays with each 1 adjacent to 3 or 4 king-move neighboring 1s.at n=11A296111