%I #5 Mar 31 2012 12:36:45
%S 4,10,10,20,90,20,35,631,631,35,56,3567,19827,3567,56,83,16493,499474,
%T 499474,16493,83,116,64018,9603489,56836178,9603489,64018,116,155,
%U 213013,144262866,4720850001,4720850001,144262866,213013,155,200,621757
%N T(n,k)=Number of nXk 0..4 arrays with rows and columns lexicographically nondecreasing and no element equal to the number of horizontal and vertical neighbors equal to itself
%C Table starts
%C ...4......10...........20..............35.................56.................83
%C ..10......90..........631............3567..............16493..............64018
%C ..20.....631........19827..........499474............9603489..........144262866
%C ..35....3567.......499474........56836178.........4720850001.......299927801278
%C ..56...16493......9603489......4720850001......1692459595971....463016032498283
%C ..83...64018....144262866....299927801278....463016032498283.545947219624185244
%C .116..213013...1757594146..15249209002599.100953294298736546
%C .155..621757..17915547783.640855702702745
%C .200.1626046.156619023957
%C .251.3878550
%H R. H. Hardin, <a href="/A201729/b201729.txt">Table of n, a(n) for n = 1..71</a>
%e Some solutions for n=3 k=3
%e ..2..3..4....0..0..1....1..3..4....0..3..3....0..0..3....0..0..3....0..2..4
%e ..3..0..2....0..4..4....2..0..0....0..4..4....0..1..3....0..2..4....0..3..2
%e ..4..0..0....1..3..1....3..1..0....3..2..4....3..3..2....1..2..4....4..2..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Dec 04 2011
|