|
%I #7 Feb 20 2019 09:58:15
%S 4,31,163,926,5315,30387,174121,998069,5720443,32788987,187945010,
%T 1077290419,6174981492,35394734997,202881130985,1162906171769,
%U 6665729691190,38207684670140,219004855904382,1255326705617567
%N Number of n X 3 0..1 arrays with no element equal to more than four of its king-move neighbors and with new values introduced in order 0 sequentially upwards.
%H R. H. Hardin, <a href="/A281832/b281832.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 5*a(n-1) + 4*a(n-2) + 6*a(n-3) - 23*a(n-4) - 25*a(n-5) - 15*a(n-6) - 28*a(n-7) for n>8.
%F Empirical g.f.: x*(4 + 11*x - 8*x^2 - 37*x^3 - 61*x^4 - 57*x^5 - 46*x^6 - 24*x^7) / (1 - 5*x - 4*x^2 - 6*x^3 + 23*x^4 + 25*x^5 + 15*x^6 + 28*x^7). - _Colin Barker_, Feb 20 2019
%e Some solutions for n=4:
%e ..0..1..1. .0..0..0. .0..1..0. .0..0..1. .0..0..0. .0..1..0. .0..1..0
%e ..1..0..1. .1..0..1. .1..1..0. .1..1..0. .0..1..1. .1..1..0. .0..1..1
%e ..0..1..0. .0..1..1. .0..1..1. .0..0..1. .0..1..0. .0..0..1. .0..1..0
%e ..0..0..0. .0..1..0. .0..1..0. .1..1..1. .1..0..0. .1..1..0. .1..1..0
%Y Column 3 of A281837.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 31 2017
| 