cp's OEIS Frontend

A200935 T(n,k)=Number of nXk 0..6 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.

%I A200935 #7 Jul 22 2025 16:01:02
%S A200935 7,21,21,57,70,57,107,86,86,107,151,466,3158,466,151,134,11620,43334,
%T A200935 43334,11620,134,70,46664,246447,1684241,246447,46664,70,906,19639,
%U A200935 16356517,21364907,21364907,16356517,19639,906,5719,1992563,8948286
%N A200935 T(n,k)=Number of nXk 0..6 arrays with every row and column running average nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.
%C A200935 Table starts
%C A200935 ....7......21.......57........107.........151........134.........70........906
%C A200935 ...21......70.......86........466.......11620......46664......19639....1992563
%C A200935 ...57......86.....3158......43334......246447...16356517....8948286.4440651544
%C A200935 ..107.....466....43334....1684241....21364907.4105461914.5978211225
%C A200935 ..151...11620...246447...21364907.10179183172
%C A200935 ..134...46664.16356517.4105461914
%C A200935 ...70...19639..8948286
%C A200935 ..906.1992563
%C A200935 .5719
%H A200935 R. H. Hardin, <a href="/A200935/b200935.txt">Table of n, a(n) for n = 1..49</a>
%e A200935 Some solutions for n=3 k=3
%e A200935 ..0..1..3....0..2..3....0..3..2....0..1..2....0..1..1....0..1..2....0..1..4
%e A200935 ..2..5..6....0..6..4....1..4..5....3..4..6....2..6..6....1..3..4....0..2..5
%e A200935 ..3..4..6....1..5..6....4..6..6....3..5..5....3..4..5....4..6..5....3..3..6
%K A200935 nonn,tabl
%O A200935 1,1
%A A200935 _R. H. Hardin_ Nov 24 2011