The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Dec 01 2012 18:01:28
%S 35,208,2030,21512,173951,1301292,9073439,59354249,365947610,
%T 2145444485,12046595329,65110996049,339811990839,1716295058005,
%U 8405359988724,39985660051195,185069683334563,834585631383453,3671657062820420
%N Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 4Xn array
%C Row 4 of A219939
%H R. H. Hardin, <a href="/A219942/b219942.txt">Table of n, a(n) for n = 1..98</a>
%e Some solutions for n=3
%e ..0..0..0....0..0..0....1..0..1....2..1..1....1..1..1....1..0..0....0..0..2
%e ..3..0..0....1..1..0....2..0..0....2..1..1....1..1..1....2..1..1....0..0..0
%e ..3..2..2....2..2..1....2..2..3....3..1..1....0..0..1....2..1..3....1..1..0
%e ..3..3..3....3..3..2....2..2..2....3..1..1....0..0..0....3..1..1....1..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 01 2012