36057

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, 0), (-1, 1, 0), (1, 0, 0), (1, 1, 1)}.at n=8A150680
• Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having one, three or four distinct clockwise edge differences.at n=3A209953
• Number of (n+1)X5 0..2 arrays with every 2X2 subblock having one, three or four distinct clockwise edge differences.at n=0A209956
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having one, three or four distinct clockwise edge differences.at n=6A209960
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having one, three or four distinct clockwise edge differences.at n=9A209960
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=8A251943
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum prime and every diagonal and antidiagonal sum nonprime.at n=36A251950