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 A250569 #6 Mar 15 2023 14:54:35 %S A250569 21952,463006,9583440,194160522,3844025984,75733658665,1486288137310, %T A250569 29093999130722,568992945964954,11121085195129708,217289681422138350, %U A250569 4244862050968522642,82917728735945546896,1619605399294091536443 %N A250569 Number of (n+2) X (3+2) 0..1 arrays with nondecreasing maximum of every three consecutive values in every row and column. %C A250569 Column 3 of A250574. %H A250569 R. H. Hardin, <a href="/A250569/b250569.txt">Table of n, a(n) for n = 1..210</a> %e A250569 Some solutions for n=1 %e A250569 ..1..0..1..0..0....0..1..0..0..1....1..1..1..0..1....1..1..0..1..1 %e A250569 ..1..1..1..0..1....1..1..0..1..1....1..0..0..1..1....0..1..0..1..0 %e A250569 ..1..1..1..0..1....0..0..0..1..1....1..1..0..0..1....0..0..0..1..0 %Y A250569 Cf. A250574. %K A250569 nonn %O A250569 1,1 %A A250569 _R. H. Hardin_, Nov 25 2014