cp's OEIS Frontend

A201105 T(n,k)=Number of nXk 0..7 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 A201105 #7 Jul 22 2025 16:06:16
%S A201105 8,28,28,90,140,90,213,334,334,213,398,103,2052,103,398,536,14881,
%T A201105 235661,235661,14881,536,496,246332,659775,267814,659775,246332,496,
%U A201105 212,838638,44795285,751183732,751183732,44795285,838638,212,3748,324469,1777011587
%N A201105 T(n,k)=Number of nXk 0..7 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 A201105 Table starts
%C A201105 ...8.....28.......90.......213.......398.......536........496....212.3748
%C A201105 ..28....140......334.......103.....14881....246332.....838638.324469
%C A201105 ..90....334.....2052....235661....659775..44795285.1777011587
%C A201105 .213....103...235661....267814.751183732.776236449
%C A201105 .398..14881...659775.751183732
%C A201105 .536.246332.44795285
%C A201105 .496.838638
%C A201105 .212
%H A201105 R. H. Hardin, <a href="/A201105/b201105.txt">Table of n, a(n) for n = 1..40</a>
%e A201105 Some solutions for n=3 k=3
%e A201105 ..0..1..3....0..2..1....0..1..2....0..4..3....0..2..5....0..4..3....0..2..5
%e A201105 ..4..6..7....3..6..5....4..5..6....2..5..6....1..3..7....1..7..6....1..3..6
%e A201105 ..2..6..5....4..4..7....3..7..7....1..7..6....4..7..6....2..7..5....4..6..7
%Y A201105 Column 1 is A200941
%K A201105 nonn,tabl
%O A201105 1,1
%A A201105 _R. H. Hardin_ Nov 26 2011