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 #8 Jul 09 2014 02:02:01
%S 21,21,308,2215,16159,105936,715430,4968426,34708110,235821971,
%T 1533422780,9520703855,56784842083,327953470848,1845044605038,
%U 10141820371575,54522037417751,286787858534562,1477004659546184
%N Number of n X 6 arrays of the minimum value of corresponding elements and their horizontal, vertical, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..2 n X 6 array.
%C Column 6 of A219915.
%H R. H. Hardin, <a href="/A219913/b219913.txt">Table of n, a(n) for n = 1..22</a>
%e Some solutions for n=3:
%e ..1..1..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....2..0..0..0..0..0
%e ..1..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....2..0..0..0..0..0
%e ..1..0..0..0..0..1....1..1..2..2..0..0....2..1..0..0..0..0....2..2..2..1..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 01 2012