cp's OEIS Frontend

A267901 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.

%I A267901 #5 Aug 12 2016 06:55:35
%S A267901 0,1,0,1,2,0,1,3,6,0,1,11,20,30,0,1,29,268,138,192,0,1,93,2324,17658,
%T A267901 1488,1560,0,1,268,28318,414138,1696920,20400,15120,0,1,842,315196,
%U A267901 28493946,134764368,273460560,317520,171360,0,1,2547,3786836,1246334388
%N A267901 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one horizontal or vertical neighbor and the top left element equal to 0.
%C A267901 Table starts
%C A267901 .0......1......1.........1.........1........1..........1.......1....1.1
%C A267901 .0......2......3........11........29.......93........268.....842.2547
%C A267901 .0......6.....20.......268......2324....28318.....315196.3786836
%C A267901 .0.....30....138.....17658....414138.28493946.1246334388
%C A267901 .0....192...1488...1696920.134764368
%C A267901 .0...1560..20400.273460560
%C A267901 .0..15120.317520
%C A267901 .0.171360
%C A267901 .0
%e A267901 Some solutions for n=4 k=4
%e A267901 ..0..0..2..2....0..0..3..3....0..0..3..3....0..2..3..3....0..0..0..3
%e A267901 ..1..1..1..1....3..2..2..1....1..1..3..3....0..2..0..0....1..1..0..3
%e A267901 ..3..0..0..3....3..2..2..1....1..2..2..0....1..3..3..1....2..2..3..2
%e A267901 ..3..2..2..3....1..1..0..0....1..2..2..0....1..2..2..1....1..1..3..2
%Y A267901 Column 2 is A005922(n-1).
%K A267901 nonn,tabl
%O A267901 1,5
%A A267901 _R. H. Hardin_, Jan 22 2016