|
%I #6 Aug 12 2016 06:55:34
%S 1,1,0,1,0,1,1,0,1,2,1,0,1,22,9,1,0,1,322,525,44,1,0,1,5826,52149,
%T 26100,265,1,0,7,116602,7517433,33089774,1916217,1854,1,0,41,2507350,
%U 1305588167,57644876152,32230426133,197069522,14833,1,0,209,56777970
%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its north, northeast or northwest neighbor modulo n and the upper left element equal to 0.
%C Table starts
%C .....1.........1...........1...........1..........1............1........1...1.1
%C .....0.........0...........0...........0..........0............0........0...0.0
%C .....1.........1...........1...........1..........1............7.......41.209
%C .....2........22.........322........5826.....116602......2507350.56777970
%C .....9.......525.......52149.....7517433.1305588167.253772079771
%C ....44.....26100....33089774.57644876152
%C ...265...1916217.32230426133
%C ..1854.197069522
%C .14833
%H R. H. Hardin, <a href="/A266886/b266886.txt">Table of n, a(n) for n = 1..50</a>
%e Some solutions for n=4 k=4
%e ..0..1..1..1....0..0..1..1....0..1..1..1....0..3..3..0....0..3..3..3
%e ..3..3..3..0....3..3..3..3....0..0..1..3....2..2..3..3....2..2..3..1
%e ..2..2..2..3....1..2..2..2....2..0..3..3....1..2..2..1....2..2..1..1
%e ..0..0..2..1....0..0..1..2....2..2..2..3....1..1..0..0....0..0..0..1
%Y Column 1 is A000166(n-1).
%K nonn,tabl
%O 1,10
%A _R. H. Hardin_, Jan 05 2016
|
