55576
domain: N
Appears in sequences
- No-3-in-line problem on n X n grid: total number of ways of placing 2n points on n X n grid so no 3 are in a line. No symmetries are taken into account.at n=16A000755
- Number of 3-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=33A187047
- Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=4A208162
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=49A208164
- Number of 5Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically.at n=5A208166
- Number of sphenic triples up to 10^n.at n=6A215152
- Number of (n+2)X(7+2) 0..1 arrays with every 2X2 and 3X3 subblock diagonal maximum minus antidiagonal minimum nondecreasing horizontally and vertically.at n=7A253509