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 28 2016 16:05:27
%S 4,81,3600,324900,48441600,10817248036,3377332413504,1404654302923524,
%T 750581746192664100,501056831514160707984,408622467650013146382336,
%U 399732806541644129265761569,461983489514281294192077209856
%N Number of 2Xn 0..n arrays with every repeated value in every row and column greater than the previous repeated value.
%C Row 2 of A268204.
%H R. H. Hardin, <a href="/A268206/b268206.txt">Table of n, a(n) for n = 1..26</a>
%e Some solutions for n=3
%e ..0..1..1....1..3..1....3..1..2....2..3..1....3..2..2....3..0..1....2..2..0
%e ..1..2..1....3..0..1....3..0..3....1..2..0....2..1..3....0..1..0....2..1..2
%Y Cf. A268204.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 28 2016