cp's OEIS Frontend

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

%I A265192 #6 Aug 12 2016 06:55:34
%S A265192 1,0,1,0,1,1,0,0,5,1,0,1,17,36,1,0,0,42,774,329,1,0,1,155,20592,76035,
%T A265192 3655,1,0,0,511,583806,20957398,10866362,47844,1,0,1,2023,17355854,
%U A265192 6394366422,38833756515,2130866037,721315,1,0,0,7760,531710144
%N A265192 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal or antidiagonal neighbors and new values introduced sequentially from 0.
%C A265192 Table starts
%C A265192 .1........0............0...............0...............0..................0
%C A265192 .1........1............0...............1...............0..................1
%C A265192 .1........5...........17..............42.............155................511
%C A265192 .1.......36..........774...........20592..........583806...........17355854
%C A265192 .1......329........76035........20957398......6394366422......2057050979371
%C A265192 .1.....3655.....10866362.....38833756515.157027988934320.683255971286971494
%C A265192 .1....47844...2130866037.117650546564305
%C A265192 .1...721315.551607137250
%C A265192 .1.12310199
%H A265192 R. H. Hardin, <a href="/A265192/b265192.txt">Table of n, a(n) for n = 1..61</a>
%e A265192 Some solutions for n=4 k=4
%e A265192 ..0..1..2..3....0..1..0..2....0..1..2..3....0..1..2..3....0..1..2..1
%e A265192 ..2..3..0..2....3..2..1..3....0..3..1..0....3..0..2..1....2..0..3..0
%e A265192 ..1..3..0..1....0..3..2..1....2..3..1..2....2..0..3..2....3..1..2..3
%e A265192 ..1..3..0..2....0..1..3..2....2..3..1..0....1..0..3..1....2..0..1..3
%Y A265192 Column 2 is A000806.
%K A265192 nonn,tabl
%O A265192 1,9
%A A265192 _R. H. Hardin_, Dec 04 2015