cp's OEIS Frontend

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.

A207760 Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.

This page as a plain text file.
%I A207760 #7 Jul 22 2025 20:48:25
%S A207760 19,361,1095,4018,16920,56651,178627,581166,1838374,5659448,17426525,
%T A207760 53447015,162579914,493375310,1495959569,4527344211,13690772759,
%U A207760 41408994328,125273246604,379174015659,1148704163123,3483663286586
%N A207760 Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 0 1 vertically.
%C A207760 Column 6 of A207762
%H A207760 R. H. Hardin, <a href="/A207760/b207760.txt">Table of n, a(n) for n = 1..210</a>
%F A207760 Empirical: a(n) = 8*a(n-1) -23*a(n-2) +57*a(n-3) -207*a(n-4) +422*a(n-5) -606*a(n-6) +1791*a(n-7) -2780*a(n-8) +2105*a(n-9) -7999*a(n-10) +9553*a(n-11) -1014*a(n-12) +25158*a(n-13) -21379*a(n-14) -11660*a(n-15) -61601*a(n-16) +31255*a(n-17) +40719*a(n-18) +108770*a(n-19) -27506*a(n-20) -67135*a(n-21) -133892*a(n-22) +17047*a(n-23) +63911*a(n-24) +107159*a(n-25) -9874*a(n-26) -38230*a(n-27) -51716*a(n-28) +8820*a(n-29) +12304*a(n-30) +14080*a(n-31) -5424*a(n-32) -2368*a(n-33) -1376*a(n-34) +1696*a(n-35) +64*a(n-36) +128*a(n-37) -256*a(n-38) for n>41
%e A207760 Some solutions for n=4
%e A207760 ..0..0..1..0..0..1....0..1..1..1..1..1....0..1..1..1..1..0....1..0..0..1..1..1
%e A207760 ..0..1..0..0..1..0....0..1..1..1..1..1....1..1..0..0..1..0....1..0..0..1..1..1
%e A207760 ..1..0..0..1..0..0....0..0..1..1..1..1....0..1..0..0..1..0....0..1..0..0..1..1
%e A207760 ..0..0..1..0..0..1....0..0..1..1..1..1....0..0..1..0..0..1....0..0..1..0..0..1
%K A207760 nonn
%O A207760 1,1
%A A207760 _R. H. Hardin_ Feb 19 2012