2959003

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, 0, 0), (-1, 1, -1), (-1, 1, 1), (1, 0, 0)}.at n=14A148533
• Number of n X 3 arrays containing 3 copies of 0..n-1 with every element equal to or 1 greater than any north neighbor modulo n and the upper left element equal to 0.at n=16A267748