login
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal vertical or antidiagonal neighbors and new values introduced sequentially from 0.
6

%I #6 Aug 12 2016 06:55:34

%S 1,1,1,1,1,1,1,1,4,1,1,1,17,23,1,1,1,75,632,209,1,1,1,342,20592,54920,

%T 2301,1,1,1,1609,734400,17745759,7286105,29992,1,1,1,7794,27705984,

%U 6394366422,29353774235,1365147580,450525,1,1,1,38769,1086831962

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal vertical or antidiagonal neighbors and new values introduced sequentially from 0.

%C Table starts

%C .1.......1............1..............1...............1.............1

%C .1.......1............1..............1...............1.............1

%C .1.......4...........17.............75.............342..........1609

%C .1......23..........632..........20592..........734400......27705984

%C .1.....209........54920.......17745759......6394366422.2477249527858

%C .1....2301......7286105....29353774235.135397500774458

%C .1...29992...1365147580.82336362679563

%C .1..450525.342267410418

%C .1.7666097

%C .1

%H R. H. Hardin, <a href="/A265679/b265679.txt">Table of n, a(n) for n = 1..60</a>

%e Some solutions for n=4 k=4

%e ..0..1..2..2....0..1..2..0....0..1..1..2....0..1..2..0....0..0..1..2

%e ..3..3..1..1....3..3..3..2....3..2..0..3....3..3..1..2....1..3..3..0

%e ..0..0..0..3....1..1..1..0....1..1..2..2....1..2..0..3....0..1..2..2

%e ..3..2..1..2....0..3..2..2....0..0..3..3....0..3..1..2....2..3..1..3

%K nonn,tabl

%O 1,9

%A _R. H. Hardin_, Dec 13 2015