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.

A228664 Number of 5 X n binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.

This page as a plain text file.
%I A228664 #12 Sep 12 2018 09:07:47
%S A228664 16,29,574,2228,24109,128740,1096624,6780585,51990406,344168764,
%T A228664 2516149353,17192729316,122982062328,852741876277,6038989672654,
%U A228664 42158071124804,297183800090933,2081125389730084,14639300678885312
%N A228664 Number of 5 X n binary arrays with top left value 1 and no two ones adjacent horizontally, diagonally or antidiagonally.
%H A228664 R. H. Hardin, <a href="/A228664/b228664.txt">Table of n, a(n) for n = 1..210</a>
%F A228664 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 A228664 Empirical g.f.: x*(16 - 35*x - 86*x^2 + 162*x^3 + 29*x^4 - 66*x^5) / (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 A228664 Some solutions for n=4:
%e A228664 ..1..0..0..0....1..0..1..0....1..0..0..0....1..0..0..1....1..0..0..1
%e A228664 ..0..0..0..0....0..0..1..0....0..0..0..0....1..0..0..0....1..0..0..0
%e A228664 ..0..0..1..0....0..0..0..0....0..1..0..1....0..0..1..0....1..0..0..1
%e A228664 ..0..0..1..0....0..0..0..1....0..1..0..0....0..0..0..0....0..0..0..0
%e A228664 ..0..0..1..0....1..0..0..1....0..1..0..0....0..0..0..1....1..0..0..1
%Y A228664 Row 5 of A228660.
%K A228664 nonn
%O A228664 1,1
%A A228664 _R. H. Hardin_, Aug 29 2013