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 A207174 #8 Jun 21 2018 05:26:43 %S A207174 12,144,396,1989,6513,15789,54208,182081,515760,1608288,5222049, %T A207174 15774129,48430957,153161876,472757845,1455155232,4543272108, %U A207174 14099458893,43567325145,135359672373,420297279776,1301704097801,4038233202624 %N A207174 Number of 6 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically. %C A207174 Row 6 of A207169. %H A207174 R. H. Hardin, <a href="/A207174/b207174.txt">Table of n, a(n) for n = 1..210</a>. %F A207174 Empirical: a(n) = a(n-1) + 21*a(n-3) + 5*a(n-4) + 5*a(n-5) - 75*a(n-6) - 50*a(n-7) + 125*a(n-9) for n>11. %F A207174 Empirical g.f.: x*(12 + 132*x + 252*x^2 + 1341*x^3 + 1440*x^4 + 180*x^5 - 5150*x^6 - 9425*x^7 - 3500*x^8 + 10125*x^9 + 10000*x^10) / (1 - x - 21*x^3 - 5*x^4 - 5*x^5 + 75*x^6 + 50*x^7 - 125*x^9). - _Colin Barker_, Jun 21 2018 %e A207174 Some solutions for n=4: %e A207174 ..0..1..1..1....0..0..1..1....1..1..0..0....1..0..0..1....1..0..0..1 %e A207174 ..1..0..0..1....1..1..1..1....0..0..1..0....0..1..0..0....0..0..1..0 %e A207174 ..1..0..0..1....0..0..1..0....0..0..1..0....0..1..0..0....0..0..1..0 %e A207174 ..1..0..0..1....0..0..1..0....0..0..1..0....0..1..0..0....0..0..1..0 %e A207174 ..1..0..0..1....0..0..1..0....0..0..1..0....0..1..0..0....0..0..1..0 %e A207174 ..1..0..0..1....0..0..1..0....0..0..1..0....0..1..0..0....0..0..1..0 %Y A207174 Cf. A207169. %K A207174 nonn %O A207174 1,1 %A A207174 _R. H. Hardin_, Feb 15 2012