A178926 T(n,k)=Log base 2 of the number of nXk binary arrays with no element equal to the modulo 2 sum of its diagonal and antidiagonal neighbors

0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 4, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 4, 2, 0, 0, 2, 4, 0, 2, 0, 0, 0, 0, 0, 0, 6, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0

Offset

1,5

Comments

Table starts

.0.0.0.0.0.0.0.0.0.0.0.0..0.0.0.0..0.0..0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0

.0.2.0.0.2.0.0.2.0.0.2.0..0.2.0.0..2.0..0.2.0.0.2.0.0.2.0.0.2.0.0.2.0.0.2.0.0.2

.0.0.0.0.0.0.0.0.0.0.0.0..0.0.0.0..0.0..0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0

.0.0.0.4.0.0.0.0.4.0.0.0..0.4.0.0..0.0..4.0.0.0.0.4.0.0.0.0.4.0.0.0.0.4.0.0.0

.0.2.0.0.4.0.0.2.0.0.4.0..0.2.0.0..4.0..0.2.0.0.4.0.0.2.0.0.4.0.0.2.0.0.4.0

.0.0.0.0.0.0.0.6.0.0.0.0..0.0.0.0..6.0..0.0.0.0.0.0.0.6.0.0.0.0.0.0.0.0.6

.0.0.0.0.0.0.0.0.0.0.0.0..0.0.0.0..0.0..0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0

.0.2.0.0.2.6.0.2.0.0.2.0..6.2.0.0..2.0..0.8.0.0.2.0.0.2.6.0.2.0.0.2.0

.0.0.0.4.0.0.0.0.8.0.0.0..0.4.0.0..0.0..8.0.0.0.0.4.0.0.0.0.8.0.0.0

.0.0.0.0.0.0.0.0.0.0.0.0..0.0.0.0..0.0..0.0.0.0.0.0.0.0.0.0.0.0.0

.0.2.0.0.4.0.0.2.0.0.8.0..0.2.0.0..4.0..0.2.0.0.8.0.0.2.0.0.4.0

.0.0.0.0.0.0.0.0.0.0.0.0..0.0.0.0..0.0..0.0.0.0.0.0.0.0.0.0.0

.0.0.0.0.0.0.0.6.0.0.0.0..0.0.0.0.12.0..0.0.0.0.0.0.0.6.0.0

.0.2.0.4.2.0.0.2.4.0.2.0..0.6.0.8..2.0..4.2.0.0.2.4.0.2.0

.0.0.0.0.0.0.0.0.0.0.0.0..0.0.0.0..0.0..0.0.0.0.0.0.0.0

.0.0.0.0.0.0.0.0.0.0.0.0..0.8.0.8..0.0..0.0.0.0.0.0.0

.0.2.0.0.4.6.0.2.0.0.4.0.12.2.0.0..4.0..0.8.0.0.4.0

.0.0.0.0.0.0.0.0.0.0.0.0..0.0.0.0..0.0..0.0.0.0

.0.0.0.4.0.0.0.0.8.0.0.0..0.4.0.0..0.0.16.0.0

.0.2.0.0.2.0.0.8.0.0.2.0..0.2.0.0..8.0..0.2

Links

R. H. Hardin, Table of n, a(n) for n = 1..797

Example

All solutions for 5X5
..1..0..0..0..0....1..1..0..1..0....1..1..1..1..1....0..1..0..0..1
..0..0..1..1..0....1..0..1..1..1....1..0..1..0..1....0..1..0..0..1
..1..1..1..1..1....1..1..1..1..1....0..1..1..1..0....1..0..1..0..1
..0..0..1..1..0....1..0..1..1..1....1..1..1..1..1....1..1..0..0..0
..1..0..0..0..0....1..1..0..1..0....0..1..1..1..0....0..0..0..1..1
...
..1..1..1..0..1....1..1..0..0..0....0..0..0..1..1....1..0..0..1..0
..0..0..0..0..1....0..0..0..1..1....1..1..0..0..0....1..0..0..1..0
..0..0..1..0..0....1..0..1..0..1....1..0..1..0..1....1..0..1..0..1
..1..1..0..1..0....1..0..0..1..0....0..1..0..0..1....0..0..0..1..1
..0..0..1..1..0....1..0..0..1..0....0..1..0..0..1....1..1..0..0..0
...
..1..0..1..1..1....0..1..1..0..0....0..0..1..1..0....1..0..1..0..1
..1..0..0..0..0....0..1..0..1..1....1..1..0..1..0....0..0..1..0..0
..0..0..1..0..0....0..0..1..0..0....0..0..1..0..0....0..1..1..1..0
..0..1..0..1..1....1..0..0..0..0....0..0..0..0..1....0..1..1..1..0
..0..1..1..0..0....1..0..1..1..1....1..1..1..0..1....0..0..1..0..0
...
..0..1..0..1..1....0..0..0..0..1....0..1..1..1..0....0..0..1..0..0
..1..1..1..0..1....0..1..1..0..0....1..1..1..1..1....0..1..1..1..0
..1..1..1..1..1....1..1..1..1..1....0..1..1..1..0....0..1..1..1..0
..1..1..1..0..1....0..1..1..0..0....1..0..1..0..1....0..0..1..0..0
..0..1..0..1..1....0..0..0..0..1....1..1..1..1..1....1..0..1..0..1
All solutions for 6X6
..0..0..1..1..0..0
..0..1..1..1..1..0
..1..1..0..0..1..1
..1..1..0..0..1..1
..0..1..1..1..1..0
..0..0..1..1..0..0
All solutions for 7X7
..1..1..0..1..0..1..1
..1..0..1..1..1..0..1
..0..1..0..1..0..1..0
..1..1..1..1..1..1..1
..0..1..0..1..0..1..0
..1..0..1..1..1..0..1
..1..1..0..1..0..1..1

Crossrefs

Sequence in context: A051584 A028645 A028710 * A028637 A070208 A028629

Adjacent sequences: A178923 A178924 A178925 * A178927 A178928 A178929

Keyword

nonn,tabl

Author

R. H. Hardin Jan 04 2011

Status

approved