|
|
A183844
|
|
Number of (n+1) X 9 binary arrays with each element of every 2 X 2 subblock being the sum mod 2 of two others.
|
|
1
|
|
|
16771, 748937, 32887826, 1514840541, 68813532021, 3170254841114, 145160761315615, 6677571801577027, 306435724460478058, 14085188244943032759, 646828687624576311193, 29721310285135340886450
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for 3 X 9
..0..0..1..0..1..1..1..0..1....0..0..0..1..0..0..1..0..1
..1..1..1..0..1..0..1..1..0....0..0..0..1..1..1..1..1..0
..1..0..1..1..1..1..0..0..1....0..0..0..1..0..1..0..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|