login
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north, west or northeast neighbors modulo n and the upper left element equal to 0.
9

%I #7 Aug 12 2016 06:55:35

%S 1,1,1,1,3,1,1,10,2,1,1,35,5,2,1,1,126,12,5,2,1,1,462,33,12,5,2,1,1,

%T 1716,97,36,12,5,2,1,1,6435,278,127,36,12,5,2,1,1,24310,821,491,135,

%U 36,12,5,2,1,1,92378,2504,1975,626,135,36,12,5,2,1,1,352716,7766,7870,3458,649,135

%N T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any north, west or northeast neighbors modulo n and the upper left element equal to 0.

%C Table starts

%C .1.1..1..1...1...1....1....1.....1......1.......1.........1..........1

%C .1.3.10.35.126.462.1716.6435.24310..92378..352716...1352078....5200300

%C .1.2..5.12..33..97..278..821..2504...7766...24609.....79116.....256012

%C .1.2..5.12..36.127..491.1975..7870..31298..124276....500855....2061014

%C .1.2..5.12..36.135..626.3458.20470.120191..684920...3792099...20520497

%C .1.2..5.12..36.135..649.4189.33828.296985.2634316..22670355..186406508

%C .1.2..5.12..36.135..649.4277.38879.451730.5950744..80445962.1059841613

%C .1.2..5.12..36.135..649.4277.39472.501695.8410362.165102597

%C .1.2..5.12..36.135..649.4277.39472.505780.9072793

%C .1.2..5.12..36.135..649.4277.39472.505780

%H R. H. Hardin, <a href="/A267392/b267392.txt">Table of n, a(n) for n = 1..197</a>

%e Some solutions for n=4 k=4

%e ..0..1..1..2....0..0..0..0....0..1..2..3....0..0..1..2....0..0..1..2

%e ..1..2..2..3....1..1..1..1....1..2..3..0....1..1..2..3....1..1..2..3

%e ..2..3..3..0....2..2..2..2....2..3..0..1....2..2..3..0....1..2..3..3

%e ..3..0..0..1....3..3..3..3....3..0..1..2....3..3..0..1....2..3..0..0

%Y Diagonal is A267337.

%Y Row 2 is A001700(n-1).

%Y Row 3 is A266292.

%K nonn,tabl

%O 1,5

%A _R. H. Hardin_, Jan 13 2016