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 A207952 #7 Jul 22 2025 21:02:45 %S A207952 26,676,4238,26569,98126,362404,1007146,2798929,6501278,15100996, %T A207952 30983078,63568729,119052836,222964624,389322036,679801329,1122859818, %U A207952 1854680356,2928100406,4622776081,7029589490,10689492100,15748468190 %N A207952 Number of 6Xn 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically. %C A207952 Row 6 of A207949 %H A207952 R. H. Hardin, <a href="/A207952/b207952.txt">Table of n, a(n) for n = 1..210</a> %F A207952 Empirical: a(n) = 2*a(n-1) +10*a(n-2) -22*a(n-3) -44*a(n-4) +110*a(n-5) +110*a(n-6) -330*a(n-7) -165*a(n-8) +660*a(n-9) +132*a(n-10) -924*a(n-11) +924*a(n-13) -132*a(n-14) -660*a(n-15) +165*a(n-16) +330*a(n-17) -110*a(n-18) -110*a(n-19) +44*a(n-20) +22*a(n-21) -10*a(n-22) -2*a(n-23) +a(n-24) %e A207952 Some solutions for n=4 %e A207952 ..1..0..1..0....1..0..0..0....0..0..0..0....0..1..0..1....0..1..0..1 %e A207952 ..0..1..0..0....0..1..0..0....1..1..1..0....1..0..0..0....0..0..0..0 %e A207952 ..0..1..0..1....0..1..0..1....1..1..1..0....1..0..0..0....1..0..0..0 %e A207952 ..1..1..1..1....1..1..1..1....1..1..0..1....0..1..0..0....1..0..0..0 %e A207952 ..1..0..1..0....1..1..1..1....1..1..0..1....0..1..0..1....1..1..1..0 %e A207952 ..1..0..1..0....0..0..0..0....0..1..0..0....0..1..0..1....1..1..1..1 %K A207952 nonn %O A207952 1,1 %A A207952 _R. H. Hardin_ Feb 21 2012