|
%I #4 Feb 06 2017 09:43:47
%S 0,0,0,0,0,0,0,30,30,0,0,412,1826,412,0,0,4018,14952,14952,4018,0,0,
%T 35472,137676,210308,137676,35472,0,0,296062,1032030,2582100,2582100,
%U 1032030,296062,0,0,2378276,7679079,27360940,36329997,27360940,7679079
%N T(n,k)=Number of nXk 0..2 arrays with no element unequal to more than four of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
%C Table starts
%C .0.........0..........0...........0...........0............0............0
%C .0.........0.........30.........412........4018........35472.......296062
%C .0........30.......1826.......14952......137676......1032030......7679079
%C .0.......412......14952......210308.....2582100.....27360940....288592122
%C .0......4018.....137676.....2582100....36329997....474264964...6056577995
%C .0.....35472....1032030....27360940...474264964...7788462424.124826907672
%C .0....296062....7679079...288592122..6056577995.124826907672
%C .0...2378276...54233948..2859154700.73617080694
%C .0..18602538..376415512.28049884760
%C .0.142686584.2558365766
%H R. H. Hardin, <a href="/A282130/b282130.txt">Table of n, a(n) for n = 1..84</a>
%F Empirical for column k:
%F k=1: a(n) = a(n-1)
%F k=2: [order 8]
%F k=3: [order 30] for n>33
%F k=4: [order 80] for n>87
%e Some solutions for n=3 k=4
%e ..0..0..1..1. .0..1..1..1. .0..1..1..2. .0..1..1..0. .0..1..1..0
%e ..1..1..1..1. .2..1..1..1. .1..1..1..0. .1..1..2..1. .1..0..1..0
%e ..2..0..1..1. .2..2..0..0. .2..1..2..2. .0..1..2..1. .0..1..1..1
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_, Feb 06 2017
| 