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.

A188820 Number of n X 5 binary arrays without the pattern 0 1 diagonally or antidiagonally.

This page as a plain text file.
%I A188820 #10 Apr 29 2018 09:03:44
%S A188820 32,169,432,841,1360,2025,2800,3721,4752,5929,7216,8649,10192,11881,
%T A188820 13680,15625,17680,19881,22192,24649,27216,29929,32752,35721,38800,
%U A188820 42025,45360,48841,52432,56169,60016,64009,68112,72361,76720,81225,85840,90601
%N A188820 Number of n X 5 binary arrays without the pattern 0 1 diagonally or antidiagonally.
%C A188820 Column 5 of A188824.
%H A188820 R. H. Hardin, <a href="/A188820/b188820.txt">Table of n, a(n) for n = 1..200</a>
%F A188820 Empirical: a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4) for n>5.
%F A188820 Conjectures from _Colin Barker_, Apr 29 2018: (Start)
%F A188820 G.f.: x*(32 + 105*x + 94*x^2 + 41*x^3 - 16*x^4) / ((1 - x)^3*(1 + x)).
%F A188820 a(n) = 9 - 48*n + 64*n^2 for n even.
%F A188820 a(n) = -48*n + 64*n^2 for n>1 and odd.
%F A188820 (End)
%e A188820 Some solutions for 3 X 5:
%e A188820 ..1..1..1..1..0....1..1..1..1..1....0..1..0..1..1....0..1..1..1..1
%e A188820 ..0..1..1..0..1....0..1..1..1..0....0..0..0..0..1....1..0..1..1..1
%e A188820 ..1..0..0..1..0....1..0..0..0..0....0..0..0..0..0....0..1..0..0..0
%Y A188820 Cf. A188824.
%K A188820 nonn
%O A188820 1,1
%A A188820 _R. H. Hardin_, Apr 11 2011