# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a282642
Showing 1-1 of 1

%I A282642 #7 Feb 20 2019 12:24:43
%S A282642 7,27,99,413,1601,6349,25153,99287,392907,1553391,6142251,24289277,
%T A282642 96042921,379779797,1501741049,5938235583,23481235283,92850420759,
%U A282642 367152906387,1451810964181,5740809545409,22700542022605,89763402870129
%N A282642 Number of n X 3 0..1 arrays with no 1 equal to more than one of its king-move neighbors.
%H A282642 R. H. Hardin, <a href="/A282642/b282642.txt">Table of n, a(n) for n = 1..210</a>
%F A282642 Empirical: a(n) = 2*a(n-1) + 6*a(n-2) + 8*a(n-3) - 5*a(n-4) + 2*a(n-5) - 2*a(n-6).
%F A282642 Empirical g.f.: x*(7 + 13*x + 3*x^2 - 3*x^3 - 2*x^5) / (1 - 2*x - 6*x^2 - 8*x^3 + 5*x^4 - 2*x^5 + 2*x^6). - _Colin Barker_, Feb 20 2019
%e A282642 Some solutions for n=4:
%e A282642 ..0..1..0. .0..0..0. .0..0..1. .1..0..0. .0..0..0. .0..1..1. .0..0..0
%e A282642 ..0..0..0. .1..0..0. .1..0..1. .0..1..0. .1..1..0. .0..0..0. .0..1..0
%e A282642 ..0..0..0. .0..0..0. .0..0..0. .0..0..0. .0..0..0. .1..0..0. .0..1..0
%e A282642 ..0..1..1. .0..0..0. .0..0..1. .1..0..1. .0..1..0. .0..0..0. .0..0..0
%Y A282642 Column 3 of A282647.
%K A282642 nonn
%O A282642 1,1
%A A282642 _R. H. Hardin_, Feb 20 2017

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE