cp's OEIS Frontend

A265656 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal diagonal or antidiagonal neighbors and new values introduced sequentially from 0.

%I A265656 #6 Aug 12 2016 06:55:34
%S A265656 1,1,1,1,2,1,1,1,7,1,1,2,20,43,1,1,1,104,1129,372,1,1,2,476,39913,
%T A265656 104241,4027,1,1,1,2428,1465545,35213302,14031233,51871,1,1,2,12362,
%U A265656 56069313,13162584704,59232755329,2641322440,773186,1,1,1,64454,2233380101
%N A265656 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal diagonal or antidiagonal neighbors and new values introduced sequentially from 0.
%C A265656 Table starts
%C A265656 .1........1............1...............1...............1.............1
%C A265656 .1........2............1...............2...............1.............2
%C A265656 .1........7...........20.............104.............476..........2428
%C A265656 .1.......43.........1129...........39913.........1465545......56069313
%C A265656 .1......372.......104241........35213302.....13162584704.5195648940117
%C A265656 .1.....4027.....14031233.....59232755329.283609520134103
%C A265656 .1....51871...2641322440.167960505022072
%C A265656 .1...773186.663690698065
%C A265656 .1.13083385
%H A265656 R. H. Hardin, <a href="/A265656/b265656.txt">Table of n, a(n) for n = 1..60</a>
%e A265656 Some solutions for n=4 k=4
%e A265656 ..0..1..1..2....0..1..2..0....0..1..2..3....0..1..2..1....0..0..1..1
%e A265656 ..2..3..0..2....3..1..2..0....2..3..0..0....3..3..2..0....2..3..2..2
%e A265656 ..2..1..1..3....3..0..3..3....0..1..2..2....2..0..1..0....1..0..0..3
%e A265656 ..3..0..0..3....1..2..1..2....3..1..3..1....1..3..2..3....3..3..1..2
%Y A265656 Column 2 is A265229.
%K A265656 nonn,tabl
%O A265656 1,5
%A A265656 _R. H. Hardin_, Dec 12 2015