|
%I #7 Feb 19 2019 14:42:35
%S 32,857,283,405,534,706,924,1190,1602,2290,3374,5036,7604,11522,17514,
%T 26762,41012,62916,96636,148524,228308,351060,539950,830528,1277578,
%U 1965406,3023596,4651588,7156298,11009776,16938296,26059354,40092080
%N Number of 6 X n 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.
%H R. H. Hardin, <a href="/A281474/b281474.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 2*a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-6) - a(n-7) for n>12.
%F Empirical g.f.: x*(32 + 793*x - 1399*x^2 + 664*x^3 - 818*x^4 + 617*x^5 - 108*x^6 - 906*x^7 + 548*x^8 - 64*x^9 + x^10 - 6*x^11) / ((1 - x)*(1 - x - x^3 - x^6)). - _Colin Barker_, Feb 19 2019
%e Some solutions for n=4:
%e ..0..1..1..0. .0..1..1..0. .0..1..0..0. .0..1..0..1. .0..0..1..0
%e ..0..0..1..0. .0..0..1..0. .1..0..1..1. .0..1..0..1. .1..0..1..0
%e ..1..0..1..0. .1..0..1..1. .1..0..1..0. .0..1..0..1. .0..0..1..0
%e ..1..0..1..1. .1..0..0..1. .0..0..1..0. .1..0..1..0. .0..1..1..0
%e ..0..1..0..0. .1..1..0..1. .0..1..1..0. .1..0..1..0. .0..1..0..0
%e ..0..1..0..1. .0..1..0..0. .0..1..0..0. .1..0..1..1. .0..1..0..1
%Y Row 6 of A281469.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 22 2017
| 