cp's OEIS Frontend

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

%I A250735 #6 Jul 23 2025 12:44:54
%S A250735 166,350,942,2434,6016,14437,34069,79704,185684,431691,1002869,
%T A250735 2329047,5409245,12563824,29186388,67808124,157558290,366127187,
%U A250735 850864580,1977462106,4595987342,10682199696,24828823703,57710916319,134142923156
%N A250735 Number of (6+1)X(n+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.
%C A250735 Row 6 of A250729
%H A250735 R. H. Hardin, <a href="/A250735/b250735.txt">Table of n, a(n) for n = 1..210</a>
%F A250735 Empirical: a(n) = 6*a(n-1) -8*a(n-2) -19*a(n-3) +61*a(n-4) -32*a(n-5) -70*a(n-6) +104*a(n-7) -30*a(n-8) -30*a(n-9) +24*a(n-10) -5*a(n-11) for n>15
%e A250735 Some solutions for n=4
%e A250735 ..0..0..0..0..0....0..0..0..0..1....0..0..0..0..1....0..0..0..1..1
%e A250735 ..0..0..0..0..0....0..0..0..0..1....0..0..0..1..0....0..0..0..1..1
%e A250735 ..0..0..0..0..0....0..0..0..0..1....1..0..1..0..1....0..0..1..1..1
%e A250735 ..0..0..0..1..1....1..0..0..0..1....0..1..0..1..1....0..0..1..1..1
%e A250735 ..0..0..0..1..1....0..1..1..1..1....1..0..1..1..1....0..0..1..1..1
%e A250735 ..0..0..1..1..1....0..1..1..1..1....0..1..1..1..1....0..0..1..1..1
%e A250735 ..0..1..1..1..1....0..1..1..1..1....1..1..1..1..1....1..1..1..1..1
%K A250735 nonn
%O A250735 1,1
%A A250735 _R. H. Hardin_, Nov 27 2014