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 A224371 #6 Jul 23 2025 05:07:30 %S A224371 86,1915,26314,311367,3607078,42132769,495660330,5848449149, %T A224371 69064897862,815702088065,9633856474182,113778532335717, %U A224371 1343744395119438,15869813554422065,187424656004529134,2213510515188443829 %N A224371 Number of nX5 0..2 arrays with rows unimodal and antidiagonals nondecreasing. %C A224371 Column 5 of A224374 %H A224371 R. H. Hardin, <a href="/A224371/b224371.txt">Table of n, a(n) for n = 1..210</a> %F A224371 Empirical: a(n) = 21*a(n-1) -141*a(n-2) +427*a(n-3) -546*a(n-4) +526*a(n-5) -2124*a(n-6) +3302*a(n-7) +2396*a(n-8) +7504*a(n-9) +580*a(n-10) +1632*a(n-11) for n>13 %e A224371 Some solutions for n=3 %e A224371 ..1..0..0..0..0....0..1..1..1..0....1..0..0..0..0....1..0..0..0..0 %e A224371 ..0..0..2..0..0....2..2..2..1..1....1..2..2..2..2....0..0..1..0..0 %e A224371 ..0..2..2..2..1....2..2..2..1..0....2..2..2..2..1....1..2..2..2..1 %K A224371 nonn %O A224371 1,1 %A A224371 _R. H. Hardin_ Apr 05 2013