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.

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

This page as a plain text file.
%I A250436 #6 Jul 23 2025 12:24:35
%S A250436 81,2160,160000,8750000,937890625,74118870000,9682651996416,
%T A250436 958582547645184,141763707879526656,16346105372357849088,
%U A250436 2632478657451209588736,338880211548064890612480
%N A250436 Number of (n+1)X(n+1) 0..2 arrays with nondecreasing sum of every two consecutive values in every row and column.
%C A250436 Diagonal of A250443
%e A250436 Some solutions for n=3
%e A250436 ..0..1..1..1....0..1..1..1....0..0..0..1....0..0..1..0....0..0..1..2
%e A250436 ..0..0..0..0....0..0..0..0....0..0..0..1....0..2..0..2....0..0..1..0
%e A250436 ..0..1..2..2....0..1..1..1....0..2..0..2....2..0..2..1....0..2..1..2
%e A250436 ..0..0..2..0....1..0..2..0....0..1..2..1....1..2..1..2....1..0..2..2
%K A250436 nonn
%O A250436 1,1
%A A250436 _R. H. Hardin_, Nov 22 2014

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.