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.
%I A250805 #7 Jul 23 2025 12:46:32 %S A250805 36,379,3081,20631,120304,634509,3104985,14345803,63351756,269772537, %T A250805 1114996177,4494912111,17741279760,68762781541,262334037201, %U A250805 987009622419,3668074098940,13482629809713,49069419165081,176992814380663 %N A250805 Number of (n+1)X(n+1) 0..2 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 A250805 Diagonal of A250812 %H A250805 R. H. Hardin, <a href="/A250805/b250805.txt">Table of n, a(n) for n = 1..47</a> %e A250805 Some solutions for n=4 %e A250805 ..2..2..2..2..0....1..1..1..1..1....2..1..1..1..1....2..2..1..1..1 %e A250805 ..0..0..0..0..0....2..2..2..2..2....0..0..0..0..1....0..0..0..0..0 %e A250805 ..2..2..2..2..2....1..1..2..2..2....0..1..1..1..2....0..1..1..1..1 %e A250805 ..1..1..1..1..2....0..0..1..2..2....0..1..1..1..2....0..1..1..1..1 %e A250805 ..0..0..1..1..2....0..0..1..2..2....0..1..1..1..2....0..1..2..2..2 %K A250805 nonn %O A250805 1,1 %A A250805 _R. H. Hardin_, Nov 27 2014