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 A224157 #6 Jul 23 2025 05:01:17 %S A224157 29,267,1252,4339,13283,39037,114537,340134,1025559,3143071,9794989, %T A224157 31018972,99708260,324764638,1069736878,3556096357,11908005965, %U A224157 40101772888,135631552056,460218357877,1565350043268,5333698073679 %N A224157 Number of nX7 0..1 arrays with diagonals and rows unimodal and antidiagonals nondecreasing. %C A224157 Column 7 of A224158 %H A224157 R. H. Hardin, <a href="/A224157/b224157.txt">Table of n, a(n) for n = 1..210</a> %F A224157 Empirical: a(n) = 8*a(n-1) -20*a(n-2) +11*a(n-3) +13*a(n-4) +18*a(n-5) -83*a(n-6) +98*a(n-7) -99*a(n-8) +159*a(n-9) -264*a(n-10) +312*a(n-11) -324*a(n-12) +647*a(n-13) -757*a(n-14) +88*a(n-15) +283*a(n-16) -257*a(n-17) -451*a(n-18) +365*a(n-19) -1074*a(n-20) +477*a(n-21) -1092*a(n-22) +258*a(n-23) -916*a(n-24) -142*a(n-25) +114*a(n-26) +202*a(n-27) +118*a(n-28) -56*a(n-29) +56*a(n-30) -24*a(n-31) +8*a(n-32) -8*a(n-33) for n>37 %e A224157 Some solutions for n=3 %e A224157 ..1..0..0..0..0..0..0....0..0..0..0..0..0..0....0..0..0..0..0..1..1 %e A224157 ..0..1..0..0..0..0..0....0..0..0..0..0..1..0....0..0..0..1..1..1..1 %e A224157 ..1..1..1..1..0..0..0....1..1..1..1..1..0..0....0..0..1..1..1..1..1 %K A224157 nonn %O A224157 1,1 %A A224157 _R. H. Hardin_ Mar 31 2013