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.

A183444 Number of n X 3 binary arrays with every 1 having exactly two king-move neighbors equal to 1.

This page as a plain text file.
%I A183444 #9 Feb 27 2018 07:11:06
%S A183444 1,9,18,30,107,265,553,1505,3852,8922,22477,56889,137617,340401,
%T A183444 851098,2091618,5160851,12817517,31655009,78159377,193558964,
%U A183444 478614470,1182673261,2925763109,7235864705,17887850273,44237338898,109401520982
%N A183444 Number of n X 3 binary arrays with every 1 having exactly two king-move neighbors equal to 1.
%C A183444 Column 3 of A183450.
%H A183444 R. H. Hardin, <a href="/A183444/b183444.txt">Table of n, a(n) for n = 1..200</a>
%F A183444 Empirical: a(n) = 2*a(n-1) - a(n-2) + 8*a(n-3) - 7*a(n-4) + 2*a(n-5) - 2*a(n-6).
%F A183444 Empirical g.f.: x*(1 + 7*x + x^2 - 5*x^3 - 2*x^5) / (1 - 2*x + x^2 - 8*x^3 + 7*x^4 - 2*x^5 + 2*x^6). - _Colin Barker_, Feb 27 2018
%e A183444 Some solutions for 5 X 3:
%e A183444 ..0..1..0....1..1..0....0..0..0....0..0..0....1..1..0....0..0..0....0..0..1
%e A183444 ..0..1..1....1..0..0....0..1..1....0..1..0....0..1..0....0..0..0....0..1..1
%e A183444 ..0..0..0....0..0..0....0..0..1....1..0..1....0..0..0....0..0..0....0..0..0
%e A183444 ..0..1..0....0..1..1....1..0..0....1..0..1....1..0..0....1..1..0....1..0..0
%e A183444 ..1..1..0....0..0..1....1..1..0....0..1..0....1..1..0....1..0..0....1..1..0
%Y A183444 Cf. A183450.
%K A183444 nonn
%O A183444 1,2
%A A183444 _R. H. Hardin_, Jan 04 2011