[go: up one dir, main page]

login
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any vertical or antidiagonal neighbor equal to n-1.
6

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

%S 1,1,0,1,0,2,1,0,8,8,1,0,30,104,48,1,0,146,2408,6440,240,1,0,620,

%T 74416,1477440,312960,1968,1,0,3018,2603736,456791920,854084640,

%U 36965712,13824,1,0,14356,97230000,161738440488,3226910232000,1480836132576,3615441408

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any vertical or antidiagonal neighbor equal to n-1.

%C Table starts

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

%C .......0............0................0.................0.................0

%C .......2............8...............30...............146...............620

%C .......8..........104.............2408.............74416...........2603736

%C ......48.........6440..........1477440.........456791920......161738440488

%C .....240.......312960........854084640.....3226910232000.14428651957822752

%C ....1968.....36965712....1480836132576.84359520856820208

%C ...13824...3615441408.2354482052331648

%C ..140160.668391093888

%C .1263360

%H R. H. Hardin, <a href="/A266042/b266042.txt">Table of n, a(n) for n = 1..55</a>

%e Some solutions for n=4 k=4

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

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

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

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

%K nonn,tabl

%O 1,6

%A _R. H. Hardin_, Dec 20 2015