cp's OEIS Frontend

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

%I A266208 #6 Aug 12 2016 06:55:34
%S A266208 1,0,0,0,0,2,0,0,0,8,0,0,0,8,48,0,0,0,8,544,240,0,0,0,16,7368,20976,
%T A266208 1968,0,0,0,312,225112,5909712,3124800,13824,0,0,0,14936,14336176,
%U A266208 2985074304,12981441744,269723136,140160,0,0,0,310552,1009920648,2484237295056
%N A266208 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any horizontal, vertical, diagonal or antidiagonal neighbor equal to n-1.
%C A266208 Table starts
%C A266208 .......1...........0..............0..............0.............0..........0
%C A266208 .......0...........0..............0..............0.............0..........0
%C A266208 .......2...........0..............0..............0.............0..........0
%C A266208 .......8...........8..............8.............16...........312......14936
%C A266208 ......48.........544...........7368.........225112......14336176.1009920648
%C A266208 .....240.......20976........5909712.....2985074304.2484237295056
%C A266208 ....1968.....3124800....12981441744.95316232354752
%C A266208 ...13824...269723136.19479242035200
%C A266208 ..140160.61919980032
%C A266208 .1263360
%H A266208 R. H. Hardin, <a href="/A266208/b266208.txt">Table of n, a(n) for n = 1..60</a>
%e A266208 Some solutions for n=5 k=4
%e A266208 ..1..1..1..1....1..4..4..4....2..0..3..2....2..0..1..1....0..0..0..3
%e A266208 ..2..0..0..2....4..2..3..2....0..0..0..3....0..0..0..1....2..1..0..3
%e A266208 ..0..0..3..3....3..3..3..0....1..1..2..3....3..3..2..1....1..1..2..3
%e A266208 ..2..3..2..4....0..2..0..2....4..1..4..3....3..4..4..4....4..4..4..4
%e A266208 ..4..4..3..4....1..1..0..1....4..1..4..2....2..4..2..3....2..3..2..1
%Y A266208 Column 1 is A173841.
%K A266208 nonn,tabl
%O A266208 1,6
%A A266208 _R. H. Hardin_, Dec 23 2015