Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Jan 23 2016 10:01:49
%S 4,16,16,64,256,60,250,4096,3600,222,964,62500,216000,49284,804,3674,
%T 929296,12067722,10941048,646416,2872,13868,13498276,648144348,
%U 2208460532,519718464,8248384,10132,51917,192321424,33600202086
%N T(n,k)=Number of nXk 0..3 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value.
%C Table starts
%C ......4..........16.............64..............250................964
%C .....16.........256...........4096............62500.............929296
%C .....60........3600.........216000.........12067722..........648144348
%C ....222.......49284.......10941048.......2208460532.......422888259007
%C ....804......646416......519718464.....370962601314....247835569655956
%C ...2872.....8248384....23689358848...58977586280183.135605581008614210
%C ..10132...102657424..1040125019968.8920181825287255
%C ..35383..1251956689.44297983526887
%C .122480.15001350400
%C .420752
%H R. H. Hardin, <a href="/A267974/b267974.txt">Table of n, a(n) for n = 1..60</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 8]
%F k=2: [order 21]
%F k=3: [order 40]
%F Empirical for row n:
%F n=1: [linear recurrence of order 8]
%F n=2: [order 21]
%e Some solutions for n=2 k=4
%e ..2..3..1..0....1..3..0..0....0..0..2..0....3..0..2..2....1..0..3..2
%e ..3..0..3..2....3..0..3..0....2..2..2..0....2..1..2..0....0..0..1..0
%Y Column 1 is A267928.
%Y Column 2 is A267929.
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 23 2016