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 A207389 #9 Jun 22 2018 07:08:25 %S A207389 21,441,2307,7561,19319,42167,82477,148743,251937,405885,627663, %T A207389 938013,1361779,1928363,2672201,3633259,4857549,6397665,8313339, %U A207389 10672017,13549455,17030335,21208901,26189615,32087833,39030501,47156871,56619237 %N A207389 Number of n X 6 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically. %C A207389 Column 6 of A207391. %H A207389 R. H. Hardin, <a href="/A207389/b207389.txt">Table of n, a(n) for n = 1..210</a> %F A207389 Empirical: a(n) = (1/36)*n^6 + (113/60)*n^5 + (151/9)*n^4 + (95/4)*n^3 - (605/36)*n^2 - (229/30)*n + 3. %F A207389 Conjectures from _Colin Barker_, Jun 22 2018: (Start) %F A207389 G.f.: x*(21 + 294*x - 339*x^2 - 62*x^3 + 139*x^4 - 36*x^5 + 3*x^6) / (1 - x)^7. %F A207389 a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7) for n>7. %F A207389 (End) %e A207389 Some solutions for n=4: %e A207389 ..0..0..0..0..0..0....0..0..0..0..0..0....1..1..1..1..1..1....1..1..0..0..0..0 %e A207389 ..0..1..1..1..0..1....1..1..1..1..1..0....1..1..1..1..0..1....1..0..1..1..0..1 %e A207389 ..0..1..1..0..0..0....1..1..0..1..1..0....1..1..1..1..1..1....1..1..1..1..0..1 %e A207389 ..0..1..1..0..0..0....1..1..1..1..1..0....1..1..1..1..0..1....1..1..1..1..0..1 %Y A207389 Cf. A207391. %K A207389 nonn %O A207389 1,1 %A A207389 _R. H. Hardin_, Feb 17 2012