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 A207173 #8 Jun 20 2018 14:26:15 %S A207173 10,100,270,1161,3445,8455,26908,82861,228060,672760,2029041,5846337, %T A207173 17039101,50518174,147655795,430953736,1267685262,3717105229, %U A207173 10874111625,31898934243,93554384968,274033182253,803273682808,2355253402240 %N A207173 Number of 5 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically. %C A207173 Row 5 of A207169. %H A207173 R. H. Hardin, <a href="/A207173/b207173.txt">Table of n, a(n) for n = 1..210</a> %F A207173 Empirical: a(n) = a(n-1) + 17*a(n-3) + 4*a(n-4) + 4*a(n-5) - 48*a(n-6) - 32*a(n-7) + 64*a(n-9) for n>11. %F A207173 Empirical g.f.: x*(10 + 90*x + 170*x^2 + 721*x^3 + 544*x^4 - 20*x^5 - 2284*x^6 - 3216*x^7 - 800*x^8 + 3392*x^9 + 2304*x^10) / ((1 - 2*x - 8*x^3)*(1 + x + 2*x^2 - 5*x^3 - 6*x^4 + 8*x^6)). - _Colin Barker_, Jun 20 2018 %e A207173 Some solutions for n=4: %e A207173 ..1..1..1..1....0..1..1..0....1..1..0..0....0..1..1..0....0..0..1..1 %e A207173 ..1..1..1..1....0..1..1..1....0..0..1..1....0..0..1..1....1..0..0..1 %e A207173 ..1..1..1..1....0..0..1..1....0..0..1..1....0..0..1..0....1..0..0..1 %e A207173 ..1..1..0..0....0..0..1..0....0..0..1..0....0..0..1..0....1..0..0..1 %e A207173 ..0..1..0..0....0..0..1..0....0..0..1..0....0..0..1..0....1..0..0..1 %Y A207173 Cf. A207169. %K A207173 nonn %O A207173 1,1 %A A207173 _R. H. Hardin_, Feb 15 2012