|
%I #4 Feb 14 2018 07:04:30
%S 0,0,0,0,1,0,0,3,3,0,0,6,9,6,0,0,17,27,27,17,0,0,41,147,130,147,41,0,
%T 0,104,643,1241,1241,643,104,0,0,261,3051,8825,21367,8825,3051,261,0,
%U 0,655,14539,72751,290941,290941,72751,14539,655,0,0,1646,69087,589816,4309263
%N T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.
%C Table starts
%C .0...0.....0.......0.........0............0..............0................0
%C .0...1.....3.......6........17...........41............104..............261
%C .0...3.....9......27.......147..........643...........3051............14539
%C .0...6....27.....130......1241.........8825..........72751...........589816
%C .0..17...147....1241.....21367.......290941........4309263.........63960652
%C .0..41...643....8825....290941......7242300......197267780.......5361395737
%C .0.104..3051...72751...4309263....197267780.....9743385598.....481541186894
%C .0.261.14539..589816..63960652...5361395737...481541186894...43313516068423
%C .0.655.69087.4803248.948323066.145483752329.23753464370841.3889298014550366
%H R. H. Hardin, <a href="/A299602/b299602.txt">Table of n, a(n) for n = 1..180</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) +2*a(n-3)
%F k=3: [order 13] for n>15
%F k=4: [order 48]
%e Some solutions for n=5 k=4
%e ..0..0..1..1. .0..0..0..0. .0..0..0..0. .0..0..0..0. .0..0..0..0
%e ..0..1..1..1. .0..0..0..0. .0..0..0..0. .0..0..0..0. .0..0..0..0
%e ..0..1..1..1. .1..0..0..0. .0..0..0..1. .0..0..0..0. .0..0..0..0
%e ..0..1..1..1. .1..1..0..0. .0..0..1..1. .0..0..0..0. .1..0..0..1
%e ..0..0..1..1. .1..1..1..0. .0..0..0..1. .0..0..0..0. .1..1..1..1
%Y Column 2 is A297972.
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_, Feb 14 2018
|
