cp's OEIS Frontend

A266572 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its northwest or southwest neighbor modulo n and the upper left element equal to 0.

%I A266572 #6 Aug 12 2016 06:55:34
%S A266572 1,1,1,1,1,2,1,1,5,6,1,1,15,74,24,1,1,109,2320,2668,120,1,1,574,77830,
%T A266572 729874,150836,720,1,1,2840,2595190,227032241,466056593,12011058,5040,
%U A266572 1,1,13767,94930586,81044162960,1814200905314,515679132204,1279437414
%N A266572 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its northwest or southwest neighbor modulo n and the upper left element equal to 0.
%C A266572 Table starts
%C A266572 .....1..........1............1.............1...........1........1..........1
%C A266572 .....1..........1............1.............1...........1........1..........1
%C A266572 .....2..........5...........15...........109.........574.....2840......13767
%C A266572 .....6.........74.........2320.........77830.....2595190.94930586.3708826784
%C A266572 ....24.......2668.......729874.....227032241.81044162960
%C A266572 ...120.....150836....466056593.1814200905314
%C A266572 ...720...12011058.515679132204
%C A266572 ..5040.1279437414
%C A266572 .40320
%H A266572 R. H. Hardin, <a href="/A266572/b266572.txt">Table of n, a(n) for n = 1..49</a>
%e A266572 Some solutions for n=4 k=4
%e A266572 ..0..1..0..3....0..1..0..3....0..1..3..3....0..2..2..3....0..2..3..2
%e A266572 ..2..2..3..0....1..2..1..2....2..3..0..1....0..3..1..1....0..0..2..1
%e A266572 ..2..1..1..3....2..3..0..3....0..2..1..3....0..3..2..1....2..3..3..1
%e A266572 ..2..1..3..0....1..0..3..2....2..2..0..1....3..2..1..0....3..0..1..1
%Y A266572 Column 1 is A000142(n-1).
%K A266572 nonn,tabl
%O A266572 1,6
%A A266572 _R. H. Hardin_, Jan 01 2016