cp's OEIS Frontend

A250761 Number of (6+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.

%I A250761 #8 Nov 18 2018 07:34:48
%S A250761 9585,22197,40023,63063,91317,124785,163467,207363,256473,310797,
%T A250761 370335,435087,505053,580233,660627,746235,837057,933093,1034343,
%U A250761 1140807,1252485,1369377,1491483,1618803,1751337,1889085,2032047,2180223,2333613
%N A250761 Number of (6+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.
%H A250761 R. H. Hardin, <a href="/A250761/b250761.txt">Table of n, a(n) for n = 1..209</a>
%F A250761 Empirical: a(n) = 2607*n^2 + 4791*n + 2187.
%F A250761 Conjectures from _Colin Barker_, Nov 18 2018: (Start)
%F A250761 G.f.: 3*x*(3195 - 2186*x + 729*x^2) / (1 - x)^3.
%F A250761 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>3.
%F A250761 (End)
%e A250761 Some solutions for n=4:
%e A250761 ..2..2..2..2..2....0..0..0..0..0....2..2..2..2..2....2..2..2..2..2
%e A250761 ..0..0..0..0..0....1..1..1..1..1....1..1..1..1..1....0..0..0..0..0
%e A250761 ..2..2..2..2..2....1..1..1..2..2....0..0..0..0..0....2..2..2..2..2
%e A250761 ..2..2..2..2..2....0..0..0..1..1....1..1..1..1..1....2..2..2..2..2
%e A250761 ..2..2..2..2..2....0..0..0..1..1....2..2..2..2..2....2..2..2..2..2
%e A250761 ..1..2..2..2..2....1..1..1..2..2....0..1..1..1..1....1..1..1..1..1
%e A250761 ..0..1..1..2..2....1..1..1..2..2....0..2..2..2..2....0..0..0..0..2
%Y A250761 Row 6 of A250755.
%K A250761 nonn
%O A250761 1,1
%A A250761 _R. H. Hardin_, Nov 27 2014