33572
domain: N
Appears in sequences
- T(n,0) + T(n,1) + ... + T(n,n), T given by A026659.at n=14A026666
- Number of possible queen moves on an n X n chessboard.at n=21A035005
- Number of (n+1)X4 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=4A206005
- Number of (n+1)X6 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=2A206007
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=23A206010
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock equal to one, and every 2X2 determinant nonzero.at n=25A206010
- Least index k such that A011540(k) >= 10^n.at n=5A217094
- Number of length 3+3 0..n arrays with some disjoint pairs in every consecutive four terms having the same sum.at n=14A247535