252097
domain: N
Appears in sequences
- Number of 2 X 2 matrices with all terms in {0,1,...,n} and even determinant.at n=24A210369
- Number of 2 X 2 matrices having all terms in {-n,...,0,..,n} and even determinant.at n=12A211154
- Number of (n+1) X (4+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=5A262328
- Number of (n+1) X (6+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=3A262330
- T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=39A262332
- T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.at n=41A262332
- Number of (2n+1) X (3+2) 0..1 arrays with each row and column modulo 3 equal to 1, read as a binary number with top and left being the most significant bits.at n=2A263908
- Number of (2n+1) X (5+2) 0..1 arrays with each row and column modulo 3 equal to 1, read as a binary number with top and left being the most significant bits.at n=1A263910
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column modulo 3 equal to 1, read as a binary number with top and left being the most significant bits.at n=23A263913
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row and column modulo 3 equal to 1, read as a binary number with top and left being the most significant bits.at n=25A263913