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 Nov 08 2012 05:10:54
%S 26,426,9110,149238,2880294,52413310,969423130,17870306268,
%T 329607859688,6079480914622,112133703714680,2068302082008760,
%U 38149959135417738,703681415905779954,12979537903131358604,239410417049738535252
%N Number of nX7 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 nX7 array
%C Column 7 of A218897
%H R. H. Hardin, <a href="/A218896/b218896.txt">Table of n, a(n) for n = 1..68</a>
%e Some solutions for n=3
%e ..0..1..0..0..0..0..0....0..1..0..0..0..1..0....0..0..0..0..0..0..1
%e ..0..0..0..1..0..0..0....0..0..0..1..0..0..0....0..0..1..0..0..0..1
%e ..0..0..0..1..0..1..0....0..0..0..1..0..0..0....0..0..0..0..1..0..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Nov 08 2012