|
%I #4 Feb 06 2017 09:40:35
%S 0,30,1826,14952,137676,1032030,7679079,54233948,376415512,2558365766,
%T 17164347665,113809824996,747874053666,4876507733454,31593219951755,
%U 203546085790772,1305114658397068,8333147791741670,53010440264163137
%N Number of nX3 0..2 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
%C Column 3 of A282130.
%H R. H. Hardin, <a href="/A282126/b282126.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 6*a(n-1) +27*a(n-2) -94*a(n-3) -412*a(n-4) -278*a(n-5) +975*a(n-6) +3434*a(n-7) +6707*a(n-8) +15412*a(n-9) +19348*a(n-10) -28040*a(n-11) -141880*a(n-12) -289800*a(n-13) -384816*a(n-14) -381408*a(n-15) -137472*a(n-16) +808096*a(n-17) +1991216*a(n-18) +2345536*a(n-19) +726976*a(n-20) -2580224*a(n-21) -3660160*a(n-22) -1949440*a(n-23) +888832*a(n-24) +2543616*a(n-25) +829184*a(n-26) -98304*a(n-27) -399360*a(n-28) -147456*a(n-29) -36864*a(n-30) for n>33
%e Some solutions for n=4
%e ..0..1..1. .0..1..1. .0..0..1. .0..1..1. .0..1..0. .0..0..0. .0..1..1
%e ..2..2..1. .1..1..0. .0..0..1. .0..1..0. .1..1..1. .1..1..0. .0..1..0
%e ..2..0..0. .1..0..1. .0..0..2. .1..0..0. .2..1..1. .0..0..1. .1..0..1
%e ..0..0..0. .2..2..2. .0..0..0. .2..1..0. .2..0..1. .0..0..2. .2..2..2
%Y Cf. A282130.
%K nonn
%O 1,2
%A _R. H. Hardin_, Feb 06 2017
| 