cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A250425 #9 Sep 07 2022 22:09:44
%S A250425 16,108,1296,12000,160000,1715000,24010000,280052640,4032758016,
%T A250425 49700008512,728933458176,9337998878208,138735983333376,
%U A250425 1829038842774000,27435582641610000,369797030228340000,5588044012339360000
%N A250425 Number of (n+1) X (n+1) 0..1 arrays with nondecreasing sum of every two consecutive values in every row and column.
%C A250425 Diagonal of A250432.
%H A250425 R. H. Hardin, <a href="/A250425/b250425.txt">Table of n, a(n) for n = 1..23</a>
%F A250425 a(n+1) = A202092(n). - _R. J. Mathar_, Dec 04 2014
%e A250425 Some solutions for n=5
%e A250425 ..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 A250425 ..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 A250425 ..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 A250425 ..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 A250425 ..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 A250425 ..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 A250425 Cf. A202092, A250432.
%K A250425 nonn
%O A250425 1,1
%A A250425 _R. H. Hardin_, Nov 22 2014