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 A207175 #8 Jun 21 2018 05:22:29 %S A207175 14,196,546,3141,11284,26866,98224,357356,1032000,3365824,11680176, %T A207175 36617616,117235264,392397376,1266731200,4070802944,13377245184, %U A207175 43530557824,140684544000,458843940864,1494645999616,4847677870336 %N A207175 Number of 7 X n 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 1 vertically. %C A207175 Row 7 of A207169. %H A207175 R. H. Hardin, <a href="/A207175/b207175.txt">Table of n, a(n) for n = 1..210</a> %F A207175 Empirical: a(n) = a(n-1) + 25*a(n-3) + 6*a(n-4) + 6*a(n-5) - 108*a(n-6) - 72*a(n-7) + 216*a(n-9) for n>11. %F A207175 Empirical g.f.: x*(14 + 182*x + 350*x^2 + 2245*x^3 + 3159*x^4 + 672*x^5 - 10107*x^6 - 22914*x^7 - 10476*x^8 + 24840*x^9 + 32400*x^10) / (1 - x - 25*x^3 - 6*x^4 - 6*x^5 + 108*x^6 + 72*x^7 - 216*x^9). - _Colin Barker_, Jun 21 2018 %e A207175 Some solutions for n=4: %e A207175 ..0..1..1..0....0..1..1..1....0..0..1..1....1..1..1..1....0..1..1..0 %e A207175 ..1..1..0..0....1..0..0..1....0..1..0..0....0..1..0..0....0..0..1..1 %e A207175 ..1..1..0..0....1..0..0..1....0..1..0..0....0..1..0..0....0..0..1..0 %e A207175 ..1..1..0..0....1..0..0..1....0..1..0..0....0..1..0..0....0..0..1..0 %e A207175 ..1..1..0..0....1..0..0..1....0..1..0..0....0..1..0..0....0..0..1..0 %e A207175 ..0..1..0..0....1..0..0..1....0..1..0..0....0..1..0..0....0..0..1..0 %e A207175 ..0..1..0..0....1..0..0..1....0..1..0..0....0..1..0..0....0..0..1..0 %Y A207175 Cf. A207169. %K A207175 nonn %O A207175 1,1 %A A207175 _R. H. Hardin_, Feb 15 2012