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 A207451 #12 Jun 23 2018 06:07:54 %S A207451 26,676,3354,10088,23530,46956,84266,139984,219258,327860,472186, %T A207451 659256,896714,1192828,1556490,1997216,2525146,3151044,3886298, %U A207451 4742920,5733546,6871436,8170474,9645168,11310650,13182676,15277626,17612504,20204938 %N A207451 Number of n X 6 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically. %C A207451 Column 6 of A207453. %H A207451 R. H. Hardin, <a href="/A207451/b207451.txt">Table of n, a(n) for n = 1..210</a> %F A207451 Empirical: a(n) = 26*n^4 + 78*n^3 - 104*n^2 + 26*n. %F A207451 Conjectures from _Colin Barker_, Jun 23 2018: (Start) %F A207451 G.f.: 26*x*(1 + 21*x + 9*x^2 - 7*x^3) / (1 - x)^5. %F A207451 a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>5. %F A207451 (End) %e A207451 Some solutions for n=5: %e A207451 1 0 1 0 1 1 0 1 1 0 1 0 1 1 1 0 1 0 1 1 0 1 1 0 %e A207451 1 1 1 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 1 1 0 0 %e A207451 0 1 1 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 1 1 0 0 %e A207451 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 %e A207451 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 1 0 1 0 0 %Y A207451 Cf. A207453. %K A207451 nonn %O A207451 1,1 %A A207451 _R. H. Hardin_, Feb 17 2012