354015
domain: N
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), (0, -1, 0), (0, 1, -1), (1, 1, 0)}.at n=11A149173
- Number of (n+1) X (1+1) 0..2 arrays with the upper median equal to the lower median in every 2 X 2 subblock.at n=6A235974
- Number of (n+1)X(7+1) 0..2 arrays with the upper median equal to the lower median in every 2X2 subblock.at n=0A235980
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median equal to the lower median in every 2X2 subblock.at n=21A235981
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the upper median equal to the lower median in every 2X2 subblock.at n=27A235981