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”).
%I #4 Jan 18 2016 20:11:48
%S 15,450,2829,32303,128441,1117207,3696933,30649693,90914453,784186403,
%T 2141552549,19980003873,50876741513,520249434779,1246972578665,
%U 13942225071453,31756214522413,383944691019691,839150694697605
%N Number of nX7 0..1 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.
%C Column 7 of A267644.
%H R. H. Hardin, <a href="/A267643/b267643.txt">Table of n, a(n) for n = 1..96</a>
%e Some solutions for n=5
%e ..0..0..1..1..0..0..1....0..1..1..0..1..0..1....0..1..0..1..0..1..1
%e ..1..1..0..0..1..0..1....1..0..0..1..0..1..0....1..0..1..0..1..0..1
%e ..0..0..1..1..0..1..0....0..0..1..0..1..0..1....0..1..0..1..1..0..0
%e ..1..0..1..0..0..1..0....1..1..0..1..0..1..0....1..0..1..0..0..1..1
%e ..1..1..0..0..1..0..1....1..1..0..0..1..0..1....1..1..0..1..0..1..0
%Y Cf. A267644.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 18 2016