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.

A202099 Number of (n+2)X9 binary arrays avoiding patterns 001 and 011 in rows and columns.

This page as a plain text file.
%I A202099 #7 Jul 22 2025 16:29:15
%S A202099 9450,99225,617400,3841600,17287200,77792400,280052640,1008189504,
%T A202099 3080579040,9412880400,25357147200,68309049600,166503308400,
%U A202099 405851814225,911913952950,2048991844900,4302882874290,9036054036009,17922751806960
%N A202099 Number of (n+2)X9 binary arrays avoiding patterns 001 and 011 in rows and columns.
%C A202099 Column 7 of A202100
%H A202099 R. H. Hardin, <a href="/A202099/b202099.txt">Table of n, a(n) for n = 1..210</a>
%F A202099 Empirical: a(n) = 2*a(n-1) +16*a(n-2) -34*a(n-3) -119*a(n-4) +272*a(n-5) +544*a(n-6) -1360*a(n-7) -1700*a(n-8) +4760*a(n-9) +3808*a(n-10) -12376*a(n-11) -6188*a(n-12) +24752*a(n-13) +7072*a(n-14) -38896*a(n-15) -4862*a(n-16) +48620*a(n-17) -48620*a(n-19) +4862*a(n-20) +38896*a(n-21) -7072*a(n-22) -24752*a(n-23) +6188*a(n-24) +12376*a(n-25) -3808*a(n-26) -4760*a(n-27) +1700*a(n-28) +1360*a(n-29) -544*a(n-30) -272*a(n-31) +119*a(n-32) +34*a(n-33) -16*a(n-34) -2*a(n-35) +a(n-36)
%e A202099 Some solutions for n=2
%e A202099 ..1..1..1..1..1..1..1..1..1....1..1..1..1..1..1..1..1..0
%e A202099 ..1..1..1..1..1..1..1..0..0....1..1..1..1..1..0..1..0..1
%e A202099 ..1..1..1..1..1..0..1..0..1....0..1..0..0..0..0..0..0..0
%e A202099 ..1..1..1..1..0..0..0..0..0....0..1..0..1..0..0..0..0..0
%K A202099 nonn
%O A202099 1,1
%A A202099 _R. H. Hardin_ Dec 11 2011