|
|
A225783
|
|
Triangle read by rows: T(n,m) is the number of n X m binary (0,1) matrices that represent perfect parity patterns.
|
|
1
|
|
|
0, 1, 0, 0, 2, 0, 0, 0, 0, 15, 0, 0, 4, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 63, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 240, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 112, 0, 0, 0, 36, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 63, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
An n X m matrix of zeros and ones is perfect if no row or column consists entirely of zeros (as counted in A183109). It is a parity pattern if every 0 is adjacent (vertically or horizontally) to an even number of 1s and every 1 is adjacent to an odd number of 1s.
|
|
LINKS
|
|
|
EXAMPLE
|
The T(5,3) = 4 perfect parity 5 X 3 patterns are
0 0 1
0 1 1
1 0 1
1 1 0
1 0 0
------
0 1 1
1 0 0
1 0 1
0 0 1
1 1 0
--------
1 0 0
1 1 0
1 0 1
0 1 1
0 0 1
--------
1 1 0
0 0 1
1 0 1
1 0 0
0 1 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|