cp's OEIS Frontend

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

%I A268142 #5 Aug 12 2016 06:55:35
%S A268142 0,0,0,0,1,0,0,1,0,0,0,3,0,6,0,0,5,8,6,0,0,0,12,32,672,0,120,0,0,26,
%T A268142 238,4734,5760,120,0,0,0,60,1488,177048,218880,1411560,0,5040,0,0,143,
%U A268142 9778,4131792,59028840,97608120,25024320,5040,0,0,0,353,91628,132137160
%N A268142 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one diagonal or antidiagonal neighbor and the top left element equal to 0.
%C A268142 Table starts
%C A268142 .0....0....0........0........0........0.......0.........0.....0...0.0
%C A268142 .0....1....1........3........5.......12......26........60...143.353
%C A268142 .0....0....0........8.......32......238....1488......9778.91628
%C A268142 .0....6....6......672.....4734...177048.4131792.132137160
%C A268142 .0....0....0.....5760...218880.59028840
%C A268142 .0..120..120..1411560.97608120
%C A268142 .0....0....0.25024320
%C A268142 .0.5040.5040
%C A268142 .0....0
%C A268142 .0
%e A268142 Some solutions for n=4 k=4
%e A268142 ..0..3..3..2....0..3..2..3....0..2..3..3....0..3..2..0....0..2..2..3
%e A268142 ..3..0..2..3....3..0..3..2....2..0..3..3....3..0..0..2....2..0..3..2
%e A268142 ..1..2..0..1....2..0..1..1....1..0..1..2....1..1..3..2....0..3..1..1
%e A268142 ..2..1..1..0....0..2..1..1....0..1..2..1....1..1..2..3....3..0..1..1
%Y A268142 Column 2 and column 3 are A005212(n-1).
%Y A268142 Row 2 is A267725.
%K A268142 nonn,tabl
%O A268142 1,12
%A A268142 _R. H. Hardin_, Jan 27 2016