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.

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

This page as a plain text file.
%I A251972 #6 Jun 18 2022 19:15:21
%S A251972 490000,60025000,7353062500,345888060000,16270574342400,
%T A251972 410018473428480,10332465530397696,167006381634183168,
%U A251972 2699368454168838144,31245878471405875200,361679014193888160000,3225176243350261200000
%N A251972 Number of (n+1) X (6+1) 0..3 arrays with nondecreasing sum of every two consecutive values in every row and column.
%C A251972 Column 6 of A251974.
%H A251972 R. H. Hardin, <a href="/A251972/b251972.txt">Table of n, a(n) for n = 1..18</a>
%e A251972 Some solutions for n=1
%e A251972 ..0..0..0..0..1..2..2....0..0..0..0..3..1..3....0..0..2..0..2..0..2
%e A251972 ..0..1..0..2..0..2..2....0..0..1..0..1..3..3....0..0..0..0..0..1..1
%Y A251972 Cf. A251974.
%K A251972 nonn
%O A251972 1,1
%A A251972 _R. H. Hardin_, Dec 12 2014