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 #7 Jul 30 2018 07:39:59
%S 5,8,15,34,61,95,137,187,246,315,395,487,592,711,845,995,1162,1347,
%T 1551,1775,2020,2287,2577,2891,3230,3595,3987,4407,4856,5335,5845,
%U 6387,6962,7571,8215,8895,9612,10367,11161,11995,12870,13787,14747,15751,16800
%N Number of 4 X n 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..1 4 X n array.
%C Row 4 of A220032.
%H R. H. Hardin, <a href="/A220034/b220034.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = (1/6)*n^3 + (1/2)*n^2 + (43/3)*n - 45 for n>5.
%F Conjectures from _Colin Barker_, Jul 30 2018: (Start)
%F G.f.: x*(5 - 12*x + 13*x^2 + 2*x^3 - 12*x^4 + 3*x^5 + 2*x^6 - x^7 + x^8) / (1 - x)^4.
%F a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>9.
%F (End)
%e Some solutions for n=3:
%e ..0..0..0....0..0..0....1..0..0....0..0..0....0..0..0....1..1..1....0..0..0
%e ..1..1..0....1..0..0....1..0..0....0..0..0....0..0..0....1..1..1....1..0..0
%e ..1..1..1....1..1..1....1..1..1....0..0..0....0..0..0....1..1..1....1..0..0
%e ..1..1..1....1..1..1....1..1..1....1..1..0....0..0..0....1..1..1....1..0..0
%Y Cf. A220032.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 03 2012