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.

A203086 Number of (n+2)X5 binary arrays avoiding patterns 000 and 101 in rows and columns.

This page as a plain text file.
%I A203086 #7 Jul 22 2025 17:00:42
%S A203086 621,2237,7558,26528,92748,319956,1110338,3857116,13368366,46374172,
%T A203086 160928422,558198034,1936342232,6717789912,23304299530,80843139172,
%U A203086 280454591492,972921980908,3375134923804,11708636231942,40618271541636
%N A203086 Number of (n+2)X5 binary arrays avoiding patterns 000 and 101 in rows and columns.
%C A203086 Column 3 of A203091
%H A203086 R. H. Hardin, <a href="/A203086/b203086.txt">Table of n, a(n) for n = 1..210</a>
%F A203086 Empirical: a(n) = a(n-1) +2*a(n-2) +19*a(n-3) +17*a(n-4) +5*a(n-5) -57*a(n-6) -51*a(n-7) +48*a(n-8) +197*a(n-9) -63*a(n-10) -429*a(n-11) -144*a(n-12) +443*a(n-13) +246*a(n-14) -220*a(n-15) -81*a(n-16) +58*a(n-17) -65*a(n-18) +10*a(n-19) +49*a(n-20) +20*a(n-21) +20*a(n-22) for n>24
%e A203086 Some solutions for n=3
%e A203086 ..0..1..1..1..1....0..0..1..1..0....1..1..0..0..1....1..0..0..1..0
%e A203086 ..1..1..1..1..1....1..1..1..1..1....1..1..0..0..1....0..0..1..0..0
%e A203086 ..0..1..1..1..1....0..1..1..0..0....0..0..1..1..0....0..1..0..0..1
%e A203086 ..0..1..1..1..0....0..1..1..0..0....0..0..1..1..0....1..0..0..1..1
%e A203086 ..1..0..0..1..0....1..0..0..1..1....1..1..1..1..1....0..0..1..0..0
%K A203086 nonn
%O A203086 1,1
%A A203086 _R. H. Hardin_ Dec 29 2011