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.

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

This page as a plain text file.
%I A207877 #7 Jul 22 2025 20:54:50
%S A207877 19,361,702,1940,4160,10742,24952,61530,143916,341856,844144,1976858,
%T A207877 4722206,11490150,27386568,65256342,157156516,378403428,901805910,
%U A207877 2160944164,5211084366,12459269388,29798331568,71701305774,171968197128
%N A207877 Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 0 and 1 1 1 vertically.
%C A207877 Column 6 of A207879
%H A207877 R. H. Hardin, <a href="/A207877/b207877.txt">Table of n, a(n) for n = 1..210</a>
%F A207877 Empirical: a(n) = 2*a(n-2) +16*a(n-3) +8*a(n-4) -24*a(n-5) -115*a(n-6) -22*a(n-7) +125*a(n-8) +346*a(n-9) -15*a(n-10) -362*a(n-11) -654*a(n-12) +63*a(n-13) +326*a(n-14) +940*a(n-15) -35*a(n-16) -527*a(n-17) -658*a(n-18) -497*a(n-19) +552*a(n-20) +390*a(n-21) +320*a(n-22) +60*a(n-23) -352*a(n-24) -8*a(n-25) -192*a(n-26) +96*a(n-27) for n>33
%e A207877 Some solutions for n=4
%e A207877 ..0..1..1..1..0..0....0..0..1..0..0..1....0..1..0..0..1..1....0..0..1..1..1..0
%e A207877 ..1..0..0..1..1..0....0..1..1..0..0..1....1..0..0..1..0..0....1..1..1..0..0..1
%e A207877 ..1..1..0..0..1..0....1..1..0..0..1..0....1..1..1..1..0..0....1..1..0..0..1..1
%e A207877 ..0..1..1..1..0..0....1..0..0..1..1..0....0..1..1..0..0..1....0..0..1..1..1..0
%K A207877 nonn
%O A207877 1,1
%A A207877 _R. H. Hardin_ Feb 21 2012