cp's OEIS Frontend

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

%I A266455 #8 Aug 12 2016 06:55:34
%S A266455 1,1,0,1,1,1,1,0,5,2,1,3,39,101,9,1,0,357,6152,3417,44,1,10,3471,
%T A266455 442285,2079765,184881,265,1,0,35003,34667512,1548940233,1362641028,
%U A266455 14216101,1854,1,35,362265,2875874396,1294905380013,12959331192279,1511484069811
%N A266455 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0.
%C A266455 Table starts
%C A266455 .....1..........1.............1..............1.............1................1
%C A266455 .....0..........1.............0..............3.............0...............10
%C A266455 .....1..........5............39............357..........3471............35003
%C A266455 .....2........101..........6152.........442285......34667512.......2875874396
%C A266455 .....9.......3417.......2079765.....1548940233.1294905380013.1166706600769605
%C A266455 ....44.....184881....1362641028.12959331192279
%C A266455 ...265...14216101.1511484069811
%C A266455 ..1854.1477674733
%C A266455 .14833
%H A266455 R. H. Hardin, <a href="/A266455/b266455.txt">Table of n, a(n) for n = 1..50</a>
%e A266455 Some solutions for n=3 k=4
%e A266455 ..0..2..2..1....0..0..0..1....0..2..0..1....0..0..1..2....0..1..0..2
%e A266455 ..2..1..1..0....2..2..0..1....0..1..2..1....2..2..1..1....2..1..2..1
%e A266455 ..2..0..1..0....2..1..2..1....2..1..2..0....2..1..0..0....1..0..2..0
%Y A266455 Column 1 is A000166(n-1).
%Y A266455 Row 2 is A138364(n-1).
%K A266455 nonn,tabl
%O A266455 1,9
%A A266455 _R. H. Hardin_, Dec 29 2015