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.

A250845 Number of (n+1)X(n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.

This page as a plain text file.
%I A250845 #7 Jul 23 2025 12:48:38
%S A250845 100,2457,44797,626416,7134786,69543783,601566177,4741091128,
%T A250845 34703305546,239290928999,1571038806045,9901650019496,60291096166330,
%U A250845 356456047451631,2054525997174241,11582011158980816,64029681309724210,347906811859565887
%N A250845 Number of (n+1)X(n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.
%C A250845 Diagonal of A250853
%H A250845 R. H. Hardin, <a href="/A250845/b250845.txt">Table of n, a(n) for n = 1..32</a>
%e A250845 Some solutions for n=3
%e A250845 ..3..3..3..2....2..2..2..2....3..2..3..3....3..3..2..2....3..2..2..2
%e A250845 ..1..1..1..2....0..0..1..1....2..2..3..3....1..2..2..2....0..1..1..2
%e A250845 ..0..0..0..1....0..0..2..2....0..0..2..2....2..3..3..3....0..1..1..2
%e A250845 ..0..2..2..3....1..1..3..3....0..1..3..3....0..1..2..2....0..2..2..3
%K A250845 nonn
%O A250845 1,1
%A A250845 _R. H. Hardin_, Nov 28 2014