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.

A282786 Number of nX3 0..1 arrays with no 1 equal to more than one of its king-move neighbors, with the exception of exactly one element.

This page as a plain text file.
%I A282786 #4 Feb 21 2017 08:40:25
%S A282786 1,8,73,318,1747,8216,38027,173722,773529,3412416,14880845,64319686,
%T A282786 276057515,1177345064,4994757435,21091941082,88706514017,371741444080,
%U A282786 1552891025645,6468454612966,26874623008899,111396556833528
%N A282786 Number of nX3 0..1 arrays with no 1 equal to more than one of its king-move neighbors, with the exception of exactly one element.
%C A282786 Column 3 of A282791.
%H A282786 R. H. Hardin, <a href="/A282786/b282786.txt">Table of n, a(n) for n = 1..210</a>
%F A282786 Empirical: a(n) = 4*a(n-1) +8*a(n-2) -8*a(n-3) -78*a(n-4) -72*a(n-5) -16*a(n-6) +64*a(n-7) -33*a(n-8) +52*a(n-9) -24*a(n-10) +8*a(n-11) -4*a(n-12)
%e A282786 Some solutions for n=4
%e A282786 ..0..1..1. .0..1..1. .0..1..0. .1..1..1. .1..0..0. .0..0..1. .1..0..1
%e A282786 ..0..0..0. .1..0..0. .1..0..0. .0..0..0. .0..0..1. .0..0..0. .0..0..1
%e A282786 ..0..0..0. .0..0..1. .0..1..0. .0..0..1. .1..1..0. .1..1..1. .0..1..0
%e A282786 ..1..1..1. .0..0..1. .0..0..0. .1..0..1. .0..0..0. .0..0..0. .0..0..0
%Y A282786 Cf. A282791.
%K A282786 nonn
%O A282786 1,2
%A A282786 _R. H. Hardin_, Feb 21 2017