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 A267787 #6 Apr 25 2023 14:47:57 %S A267787 92,8464,94554,1262760,6484282,37282358,132388406,494152778, %T A267787 1413416776,4075463059,10085356510,24517514814,54597894654, %U A267787 117609577403,241451087194,475306643051,914206899594,1678474455790,3059283203316 %N A267787 Number of n X 7 0..1 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. %C A267787 Column 7 of A267788. %H A267787 R. H. Hardin, <a href="/A267787/b267787.txt">Table of n, a(n) for n = 1..46</a> %e A267787 Some solutions for n=3 %e A267787 ..0..0..1..0..0..0..1....0..0..0..0..0..1..0....0..0..0..1..0..0..0 %e A267787 ..1..1..1..1..1..0..1....1..1..1..1..1..1..0....0..0..1..1..0..1..1 %e A267787 ..1..0..0..1..0..1..0....1..0..0..0..1..0..1....1..1..1..0..1..1..1 %Y A267787 Cf. A267788. %K A267787 nonn %O A267787 1,1 %A A267787 _R. H. Hardin_, Jan 20 2016