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 A207750 #7 Jul 22 2025 20:46:49 %S A207750 16,256,1296,4900,23716,104976,509796,2421136,11943936,58828900, %T A207750 294946276,1484406784,7542922500,38500718656,197686944400, %U A207750 1018981226916,5273535630724,27375958697616,142523723188900,743755656909456 %N A207750 Number of nX6 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically. %C A207750 Column 6 of A207752 %H A207750 R. H. Hardin, <a href="/A207750/b207750.txt">Table of n, a(n) for n = 1..210</a> %F A207750 Empirical: a(n) = 16*a(n-1) -51*a(n-2) -429*a(n-3) +2765*a(n-4) +2887*a(n-5) -49472*a(n-6) +27551*a(n-7) +474394*a(n-8) -614722*a(n-9) -2782958*a(n-10) +4898822*a(n-11) +10501999*a(n-12) -22329850*a(n-13) -25727935*a(n-14) +64110703*a(n-15) +39685329*a(n-16) -118628973*a(n-17) -34454062*a(n-18) +139468939*a(n-19) +9485400*a(n-20) -98917632*a(n-21) +9240912*a(n-22) +37628064*a(n-23) -8055936*a(n-24) -5645376*a(n-25) +1679616*a(n-26) for n>27 %e A207750 Some solutions for n=4 %e A207750 ..0..1..0..1..0..0....0..1..0..1..0..1....1..1..1..0..0..0....1..1..1..1..0..1 %e A207750 ..0..1..0..1..0..1....0..0..0..0..0..0....0..0..0..0..0..0....0..1..0..1..0..1 %e A207750 ..0..0..0..0..0..0....0..1..0..1..0..1....1..1..1..0..0..0....1..0..1..0..0..0 %e A207750 ..0..1..0..1..0..1....0..1..0..0..0..0....0..0..0..0..0..0....0..1..0..1..0..1 %K A207750 nonn %O A207750 1,1 %A A207750 _R. H. Hardin_ Feb 19 2012