cp's OEIS Frontend

A200902 T(n,k)=Number of nXk 0..5 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 A200902 #7 Jul 22 2025 16:00:10
%S A200902 6,15,15,33,30,33,46,13,13,46,44,649,1848,649,44,20,3247,1329,1329,
%T A200902 3247,20,214,1483,219302,352339,219302,1483,214,1055,84463,142698,
%U A200902 8982755,8982755,142698,84463,1055,3020,395138,28966191,18172239,218373106
%N A200902 T(n,k)=Number of nXk 0..5 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 A200902 Table starts
%C A200902 ....6.....15.......33.........46.........44.........20..........214
%C A200902 ...15.....30.......13........649.......3247.......1483........84463
%C A200902 ...33.....13.....1848.......1329.....219302.....142698.....28966191
%C A200902 ...46....649.....1329.....352339....8982755...18172239...6469118415
%C A200902 ...44...3247...219302....8982755..218373106.2162004143.784706456797
%C A200902 ...20...1483...142698...18172239.2162004143
%C A200902 ..214..84463.28966191.6469118415
%C A200902 .1055.395138.19687441
%C A200902 .3020.147370
%C A200902 .5124
%H A200902 R. H. Hardin, <a href="/A200902/b200902.txt">Table of n, a(n) for n = 1..60</a>
%e A200902 Some solutions for n=3 k=3
%e A200902 ..0..1..4....0..1..1....0..0..2....0..0..2....0..1..2....0..1..1....0..0..4
%e A200902 ..0..2..4....2..3..5....1..1..3....1..5..3....0..3..3....0..4..5....1..3..4
%e A200902 ..2..3..5....2..4..5....2..5..4....4..4..5....2..4..5....2..4..3....1..2..5
%K A200902 nonn,tabl
%O A200902 1,1
%A A200902 _R. H. Hardin_ Nov 23 2011