cp's OEIS Frontend

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

%I A265863 #6 Aug 12 2016 06:55:34
%S A265863 1,1,0,1,2,2,1,0,22,8,1,6,152,384,48,1,0,1462,22016,19080,240,1,20,
%T A265863 13772,1584088,11544576,1019328,1968,1,0,139144,124214208,8616332520,
%U A265863 7521762432,106546608,13824,1,70,1431824,10318543104,7213744082208
%N A265863 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element plus any vertical neighbor equal to n-1.
%C A265863 Table starts
%C A265863 ......1...........1..............1..............1.............1
%C A265863 ......0...........2..............0..............6.............0
%C A265863 ......2..........22............152...........1462.........13772
%C A265863 ......8.........384..........22016........1584088.....124214208
%C A265863 .....48.......19080.......11544576.....8616332520.7213744082208
%C A265863 ....240.....1019328.....7521762432.71643177829872
%C A265863 ...1968...106546608.11355242996304
%C A265863 ..13824.11075595648
%C A265863 .140160
%H A265863 R. H. Hardin, <a href="/A265863/b265863.txt">Table of n, a(n) for n = 1..50</a>
%e A265863 Some solutions for n=3 k=4
%e A265863 ..0..2..1..0....0..2..2..0....2..1..0..1....0..2..0..1....0..0..2..1
%e A265863 ..0..1..2..0....1..2..1..0....2..2..1..0....1..2..0..2....0..0..1..2
%e A265863 ..1..2..2..1....2..1..0..1....2..1..0..0....0..2..1..1....1..1..2..2
%Y A265863 Column 1 is A173841.
%Y A265863 Row 2 is A126869.
%K A265863 nonn,tabl
%O A265863 1,5
%A A265863 _R. H. Hardin_, Dec 17 2015