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.

A228686 Number of 5 X n binary arrays with no two ones adjacent horizontally, diagonally or antidiagonally.

This page as a plain text file.
%I A228686 #11 Sep 12 2018 15:08:28
%S A228686 32,99,1277,6160,56549,333517,2644336,17124415,127116873,859773376,
%T A228686 6193234393,42741157353,303661236672,2115245880075,14933039299621,
%U A228686 104468526402928,735366366459485,5154677670070421,36235570461792016
%N A228686 Number of 5 X n binary arrays with no two ones adjacent horizontally, diagonally or antidiagonally.
%H A228686 R. H. Hardin, <a href="/A228686/b228686.txt">Table of n, a(n) for n = 1..210</a>
%F A228686 Empirical: a(n) = 4*a(n-1) + 34*a(n-2) - 76*a(n-3) - 134*a(n-4) + 258*a(n-5) + 45*a(n-6) - 102*a(n-7).
%F A228686 Empirical g.f.: x*(32 - 29*x - 207*x^2 + 118*x^3 + 303*x^4 - 57*x^5 - 102*x^6) / (1 - 4*x - 34*x^2 + 76*x^3 + 134*x^4 - 258*x^5 - 45*x^6 + 102*x^7). - _Colin Barker_, Sep 12 2018
%e A228686 Some solutions for n=4:
%e A228686 ..0..0..0..0....0..0..0..1....1..0..1..0....0..1..0..1....0..0..0..0
%e A228686 ..0..0..0..1....0..0..0..1....0..0..1..0....0..1..0..1....1..0..0..0
%e A228686 ..0..1..0..1....0..0..0..0....1..0..0..0....0..0..0..1....0..0..1..0
%e A228686 ..0..1..0..0....1..0..0..0....0..0..0..1....1..0..0..1....1..0..1..0
%e A228686 ..0..0..0..0....0..0..0..1....0..0..0..0....0..0..0..0....0..0..1..0
%Y A228686 Row 5 of A228683.
%K A228686 nonn
%O A228686 1,1
%A A228686 _R. H. Hardin_, Aug 30 2013