login

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”).

Number of (n+1) X (n+1) 0..1 arrays with nondecreasing sum of every two consecutive values in every row and column.
1

%I #9 Sep 07 2022 22:09:44

%S 16,108,1296,12000,160000,1715000,24010000,280052640,4032758016,

%T 49700008512,728933458176,9337998878208,138735983333376,

%U 1829038842774000,27435582641610000,369797030228340000,5588044012339360000

%N Number of (n+1) X (n+1) 0..1 arrays with nondecreasing sum of every two consecutive values in every row and column.

%C Diagonal of A250432.

%H R. H. Hardin, <a href="/A250425/b250425.txt">Table of n, a(n) for n = 1..23</a>

%F a(n+1) = A202092(n). - _R. J. Mathar_, Dec 04 2014

%e Some solutions for n=5

%e ..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..1..0

%e ..0..0..0..0..1..0....0..0..0..1..0..1....0..0..0..0..1..1....0..0..0..1..1..1

%e ..0..0..0..1..1..1....0..0..0..0..1..1....0..0..0..1..1..1....1..0..1..0..1..1

%e ..0..0..0..0..1..0....0..0..0..1..1..1....0..1..1..1..1..1....0..1..0..1..1..1

%e ..1..1..1..1..1..1....1..0..1..0..1..1....1..1..1..1..1..1....1..0..1..0..1..1

%e ..0..0..0..1..1..1....1..0..1..1..1..1....0..1..1..1..1..1....0..1..0..1..1..1

%Y Cf. A202092, A250432.

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 22 2014