%I #5 Mar 31 2012 12:36:44
%S 3,3,3,1,11,1,3,13,13,3,3,76,99,76,3,1,160,622,622,160,1,3,111,3406,
%T 33740,3406,111,3,3,560,16399,561271,561271,16399,560,3,1,955,70192,
%U 2740779,28384610,2740779,70192,955,1,3,539,272801,96745050,416592852
%N T(n,k)=Number of nXk 0..2 arrays with rows and columns lexicographically nondecreasing and the instance counts of every value within one of each other
%C Table starts
%C .3....3.......1...........3..............3...............1................3
%C .3...11......13..........76............160.............111..............560
%C .1...13......99.........622...........3406...........16399............70192
%C .3...76.....622.......33740.........561271.........2740779.........96745050
%C .3..160....3406......561271.......28384610.......416592852......44447452442
%C .1..111...16399.....2740779......416592852.....54217235230....6052024146349
%C .3..560...70192....96745050....44447452442...6052024146349.6095310292410589
%C .3..955..272801..1042095316..1424312724034.587944908602174
%C .1..539..974066..3442865393.13770911283918
%C .3.2447.3232454.88529711419
%H R. H. Hardin, <a href="/A201432/b201432.txt">Table of n, a(n) for n = 1..97</a>
%e Some solutions for n=3 k=7
%e ..0..0..1..2..2..2..2....0..1..1..2..2..2..2....0..0..1..1..1..1..2
%e ..0..1..2..1..1..1..1....1..0..1..0..0..1..2....0..1..0..1..2..2..2
%e ..0..2..2..0..0..0..1....1..1..2..0..0..2..0....0..1..0..2..2..2..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Dec 01 2011
|