|
%I #4 Feb 05 2018 13:55:19
%S 1,1,1,1,5,1,1,7,7,1,1,18,6,18,1,1,31,18,18,31,1,1,65,30,55,30,65,1,1,
%T 130,87,192,192,87,130,1,1,253,202,652,1095,652,202,253,1,1,519,526,
%U 2002,5042,5042,2002,526,519,1,1,1018,1449,6741,21251,35320,21251,6741,1449
%N T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 2, 3, 5, 6 or 7 king-move adjacent elements, with upper left element zero.
%C Table starts
%C .1...1....1.....1......1........1.........1..........1............1
%C .1...5....7....18.....31.......65.......130........253..........519
%C .1...7....6....18.....30.......87.......202........526.........1449
%C .1..18...18....55....192......652......2002.......6741........23631
%C .1..31...30...192...1095.....5042.....21251.....111818.......577544
%C .1..65...87...652...5042....35320....223750....1634125.....12440063
%C .1.130..202..2002..21251...223750...2044405...21212789....227105938
%C .1.253..526..6741.111818..1634125..21212789..321811361...4948662848
%C .1.519.1449.23631.577544.12440063.227105938.4948662848.111378069579
%H R. H. Hardin, <a href="/A299249/b299249.txt">Table of n, a(n) for n = 1..197</a>
%F Empirical for column k:
%F k=1: a(n) = a(n-1)
%F k=2: a(n) = a(n-1) +3*a(n-2) -4*a(n-4) for n>5
%F k=3: [order 19] for n>20
%F k=4: [order 72] for n>73
%e Some solutions for n=5 k=4
%e ..0..0..1..1. .0..1..0..0. .0..0..0..0. .0..0..1..1. .0..1..0..1
%e ..0..1..0..1. .0..0..0..1. .0..0..0..0. .1..0..1..0. .1..1..1..1
%e ..1..1..0..0. .0..1..1..1. .1..1..0..0. .1..1..1..1. .0..1..1..0
%e ..0..0..1..1. .1..0..0..0. .1..1..0..0. .0..1..1..0. .1..1..0..0
%e ..1..0..1..0. .1..1..0..1. .1..1..0..0. .1..1..0..0. .0..1..1..0
%Y Column 2 is A297937.
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_, Feb 05 2018
|
