|
%I #4 Jan 21 2017 08:00:38
%S 0,484,1294,3736,10130,23216,51940,117788,262870,583824,1296590,
%T 2854868,6264318,13732464,29980832,65248624,141764680,307282580,
%U 664563862,1434891116,3092843594,6655463192,14301788146,30691683240,65779786142
%N Number of nX6 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
%C Column 6 of A281400.
%H R. H. Hardin, <a href="/A281398/b281398.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 3*a(n-1) -a(n-2) +5*a(n-3) -15*a(n-4) -7*a(n-5) +2*a(n-6) +20*a(n-7) +36*a(n-8) -22*a(n-10) -40*a(n-11) -51*a(n-12) +7*a(n-13) +60*a(n-14) +30*a(n-15) +12*a(n-16) -2*a(n-17) -33*a(n-18) -21*a(n-19) +9*a(n-20) +9*a(n-21) for n>34
%e Some solutions for n=4
%e ..0..1..1..1..0..1. .0..1..0..0..1..1. .0..0..1..0..1..1. .0..1..0..1..0..1
%e ..0..0..1..0..0..0. .0..1..1..0..1..0. .1..0..1..0..0..1. .0..0..0..1..0..1
%e ..1..0..1..0..1..1. .0..0..1..0..0..1. .1..0..1..1..0..1. .1..0..1..1..0..1
%e ..1..0..1..0..0..1. .1..0..1..1..0..0. .1..0..1..0..0..1. .1..0..1..0..0..1
%Y Cf. A281400.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 21 2017
| 