login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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
R. Chapman, D. E. Knuth, Problem 11243, Perfect parity patterns, Am. Math. Monthly 115 (7) (2008) p 668.
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
Sequence in context: A230614 A230730 A299905 * A135468 A003196 A319581
KEYWORD
nonn,tabl
AUTHOR
R. J. Mathar, Jun 13 2014
STATUS
approved