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 A207395 #7 Jul 22 2025 20:22:10 %S A207395 12,144,556,2239,10570,42167,158217,616386,2348280,8718366,32527713, %T A207395 121179612,448121671,1656554267,6126075658,22616670998,83456777796, %U A207395 308017759907,1136469054610,4192305708517,15465595040747,57051037851614 %N A207395 Number of 6Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically. %C A207395 Row 6 of A207391 %H A207395 R. H. Hardin, <a href="/A207395/b207395.txt">Table of n, a(n) for n = 1..210</a> %F A207395 Empirical: a(n) = 7*a(n-1) -18*a(n-2) +55*a(n-3) -200*a(n-4) +369*a(n-5) -674*a(n-6) +1854*a(n-7) -2594*a(n-8) +3352*a(n-9) -8455*a(n-10) +8966*a(n-11) -8626*a(n-12) +23465*a(n-13) -17866*a(n-14) +13584*a(n-15) -43963*a(n-16) +20792*a(n-17) -14014*a(n-18) +54787*a(n-19) -10215*a(n-20) +8428*a(n-21) -43050*a(n-22) -3791*a(n-23) -2916*a(n-24) +21630*a(n-25) +6143*a(n-26) +1316*a(n-27) -7216*a(n-28) -2448*a(n-29) -381*a(n-30) +1354*a(n-31) +446*a(n-32) -120*a(n-34) %e A207395 Some solutions for n=4 %e A207395 ..0..1..1..0....0..0..0..0....0..1..1..0....0..1..1..1....0..1..1..1 %e A207395 ..1..0..1..1....0..1..1..1....0..1..1..0....1..0..1..1....0..1..1..0 %e A207395 ..1..0..1..1....0..0..0..0....0..1..1..0....0..1..1..1....0..1..1..1 %e A207395 ..1..0..1..1....0..1..1..0....0..1..1..0....1..0..1..1....0..1..1..1 %e A207395 ..1..0..1..1....0..1..1..0....0..1..1..0....1..0..1..1....0..1..1..1 %e A207395 ..1..0..1..1....0..1..1..0....0..1..1..0....1..0..1..1....0..1..1..1 %K A207395 nonn %O A207395 1,1 %A A207395 _R. H. Hardin_ Feb 17 2012