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 A189065 #7 Jun 22 2022 12:02:19 %S A189065 8,64,316,1404,6768,33893,167473,818962,4010648,19690604,96675456, %T A189065 474386856,2327622672,11421964786,56051074387,275054292017, %U A189065 1349734580410,6623378938847,32502145147429,159493994166901,782665804236299 %N A189065 Number of 3 X n binary arrays without the pattern 0 1 0 antidiagonally or horizontally. %C A189065 Row 3 of A189064. %H A189065 R. H. Hardin, <a href="/A189065/b189065.txt">Table of n, a(n) for n = 1..200</a> %F A189065 Empirical: a(n) = 4*a(n-1) -6*a(n-2) +33*a(n-3) +51*a(n-4) +108*a(n-5) +325*a(n-6) +320*a(n-7) +280*a(n-8) +264*a(n-9) -424*a(n-10) -882*a(n-11) -362*a(n-12) +68*a(n-13) +97*a(n-14) +92*a(n-15) +38*a(n-16) -a(n-17) -a(n-18) -2*a(n-19) -a(n-20). %e A189065 Some solutions for 3 X 3 %e A189065 ..1..0..1....1..1..0....1..0..1....1..1..1....1..1..0....0..1..1....1..1..1 %e A189065 ..0..0..0....1..1..0....0..0..0....1..1..1....1..0..1....1..1..0....0..1..1 %e A189065 ..0..0..0....1..1..0....1..0..1....1..1..1....1..0..0....0..0..1....1..0..0 %Y A189065 Cf. A189064. %K A189065 nonn %O A189065 1,1 %A A189065 _R. H. Hardin_, Apr 16 2011