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 A207691 #7 Jul 22 2025 20:40:50 %S A207691 25,625,576,2304,6084,15376,40000,108900,304704,770884,2102500, %T A207691 5692996,14915044,40653376,107453956,288252484,776179600,2054990224, %U A207691 5544589444,14786560000,39491228176,106128699076,282653849104,758254325284 %N A207691 Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 1 vertically. %C A207691 Column 6 of A207693 %H A207691 R. H. Hardin, <a href="/A207691/b207691.txt">Table of n, a(n) for n = 1..210</a> %F A207691 Empirical: a(n) = a(n-1) +a(n-2) +14*a(n-3) -6*a(n-4) +33*a(n-5) -128*a(n-6) +8*a(n-7) -228*a(n-8) +384*a(n-9) +83*a(n-10) +439*a(n-11) -949*a(n-12) -958*a(n-13) +282*a(n-14) +3103*a(n-15) +1779*a(n-16) -3073*a(n-17) -7347*a(n-18) -2028*a(n-19) +5069*a(n-20) +9884*a(n-21) +3661*a(n-22) -4410*a(n-23) -8135*a(n-24) -4196*a(n-25) +2169*a(n-26) +4570*a(n-27) +1924*a(n-28) +429*a(n-29) -2446*a(n-30) -440*a(n-31) -701*a(n-32) +1325*a(n-33) +181*a(n-34) +282*a(n-35) -491*a(n-36) -4*a(n-37) -34*a(n-38) +103*a(n-39) -6*a(n-40) -2*a(n-41) -15*a(n-42) +a(n-43) +a(n-45) for n>47 %e A207691 Some solutions for n=4 %e A207691 ..1..0..1..1..1..1....1..0..1..1..0..1....1..1..1..1..1..1....1..0..1..1..1..0 %e A207691 ..0..1..1..1..0..0....0..1..1..0..1..1....0..1..1..0..0..1....0..1..1..0..0..1 %e A207691 ..1..1..0..0..1..1....1..1..0..1..1..0....1..0..0..1..1..0....1..0..0..1..1..0 %e A207691 ..1..0..0..1..1..0....1..0..1..1..0..0....0..0..1..1..1..1....1..0..1..1..1..1 %K A207691 nonn %O A207691 1,1 %A A207691 _R. H. Hardin_ Feb 19 2012