A267338 - OEIS

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

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

%T 1716,77,45,2,2,1,1,1,6435,222,135,36,2,2,1,1,1,24310,700,388,264,4,2,

%U 2,1,1,1,92378,2297,1220,1223,135,4,2,2,1,1,1,352716,6869,5401,4462,2192,9,4,2,2

%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 southwest 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.1..5.11..24..77..222...700...2297.....6869.....21609......71873....232180

%C .1.1..2.12..45.135..388..1220...5401....27146....125333.....515897...2010472

%C .1.1..2..2..36.264.1223..4462..14328....55017....305712....2436601..19006535

%C .1.1..2..2...4.135.2192.18140..96291...401459...1594603....7089502..45031108

%C .1.1..2..2...4...9..649.25661.413155..3534075..21319105..108404456.526041190

%C .1.1..2..2...4...9...24..4277.418273.14116549.214106961.2025457429

%C .1.1..2..2...4...9...24....89..39472..9498724.711260225

%C .1.1..2..2...4...9...24....89....594...505780

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

%e Some solutions for n=4 k=4

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

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

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

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

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

%Y Row 3 is A266905.

%K nonn,tabl

%O 1,5

%A _R. H. Hardin_, Jan 13 2016