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 20 2016 07:03:41
%S 8,64,512,3375,21952,132651,778688,4410944,24389000,131872229,
%T 700227072,3659383421,18863581528,96071912000,484106454208,
%U 2416353439059,11958715956032,58732317850311,286451826688000,1388285542167616
%N Number of nX3 0..1 arrays with every repeated value in every row and column greater than or equal to the previous repeated value.
%C Column 3 of A267735.
%H R. H. Hardin, <a href="/A267730/b267730.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 12*a(n-1) -30*a(n-2) -120*a(n-3) +455*a(n-4) +576*a(n-5) -2142*a(n-6) -1980*a(n-7) +3180*a(n-8) +1980*a(n-9) -2142*a(n-10) -576*a(n-11) +455*a(n-12) +120*a(n-13) -30*a(n-14) -12*a(n-15) -a(n-16)
%e Some solutions for n=4
%e ..0..0..1....1..0..1....1..1..1....0..0..0....0..1..0....1..0..1....1..1..1
%e ..0..1..0....1..1..1....1..0..0....0..1..0....0..0..1....0..1..1....0..0..0
%e ..1..1..0....0..0..0....1..0..1....1..0..0....0..0..0....0..0..1....1..1..1
%e ..1..1..0....1..1..1....0..0..0....1..0..1....0..0..1....0..1..0....0..0..1
%Y Cf. A267735.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 20 2016