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 A207739 #7 Jul 22 2025 20:45:11 %S A207739 25,625,5625,60025,731025,9259849,120275089,1573946929,20694836449, %T A207739 272495484121,3591309255625,47344514140225,624257470671025, %U A207739 8231565447600625,108546609662015625,1431380241299659849 %N A207739 Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically. %C A207739 Column 6 of A207741 %H A207739 R. H. Hardin, <a href="/A207739/b207739.txt">Table of n, a(n) for n = 1..210</a> %F A207739 Empirical: a(n) = 18*a(n-1) -15*a(n-2) -886*a(n-3) +2660*a(n-4) +11504*a(n-5) -45589*a(n-6) -59632*a(n-7) +324536*a(n-8) +106556*a(n-9) -1182417*a(n-10) +142992*a(n-11) +2369549*a(n-12) -855890*a(n-13) -2672392*a(n-14) +1338432*a(n-15) +1706837*a(n-16) -1018340*a(n-17) -603507*a(n-18) +418566*a(n-19) +106712*a(n-20) -93358*a(n-21) -5923*a(n-22) +10536*a(n-23) -500*a(n-24) -506*a(n-25) +51*a(n-26) +8*a(n-27) -a(n-28) for n>29 %e A207739 Some solutions for n=4 %e A207739 ..0..0..1..1..1..0....0..1..1..1..0..0....0..1..1..0..1..1....1..0..1..1..0..1 %e A207739 ..0..0..1..1..0..1....1..0..1..1..1..1....0..1..1..1..1..0....1..1..1..1..1..1 %e A207739 ..0..0..1..1..1..0....1..1..0..0..1..1....0..0..1..1..0..1....0..1..1..1..1..0 %e A207739 ..0..0..1..1..1..1....1..1..1..1..0..0....0..1..1..1..1..0....1..0..0..1..1..1 %K A207739 nonn %O A207739 1,1 %A A207739 _R. H. Hardin_ Feb 19 2012