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.

A251971 Number of (n+1)X(5+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 A251971 #6 Jul 23 2025 13:35:46
%S A251971 160000,12250000,937890625,29412250000,922368160000,16270574342400,
%T A251971 287012931399936,3373866295640064,39660142577319936,
%U A251971 344307200786841600,2989082761932960000,20503345475844000000,140640861824100000000
%N A251971 Number of (n+1)X(5+1) 0..3 arrays with nondecreasing sum of every two consecutive values in every row and column.
%C A251971 Column 5 of A251974
%H A251971 R. H. Hardin, <a href="/A251971/b251971.txt">Table of n, a(n) for n = 1..26</a>
%e A251971 Some solutions for n=1
%e A251971 ..2..1..2..3..3..3....0..1..3..2..3..2....0..1..1..3..2..3....0..2..2..2..2..3
%e A251971 ..2..1..2..1..2..2....2..0..2..2..2..3....0..3..0..3..3..3....0..0..1..2..1..3
%K A251971 nonn
%O A251971 1,1
%A A251971 _R. H. Hardin_, Dec 12 2014