# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a201142 Showing 1-1 of 1 %I A201142 #5 Mar 31 2012 12:36:43 %S A201142 6,15,15,20,30,20,15,5,5,15,6,135,402,135,6,1,282,117,117,282,1,6,51, %T A201142 5252,7642,5252,51,6,15,848,758,38763,38763,758,848,15,20,1189,35810, %U A201142 13009,129244,13009,35810,1189,20,15,120,4788,593543,120096,120096 %N A201142 T(n,k)=Number of nXk 0..5 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other %C A201142 Table starts %C A201142 ..6...15.....20.......15.........6..........1............6............15 %C A201142 .15...30......5......135.......282.........51..........848..........1189 %C A201142 .20....5....402......117......5252........758........35810..........4788 %C A201142 .15..135....117.....7642.....38763......13009.......593543.......2004404 %C A201142 ..6..282...5252....38763....129244.....120096......4264060......46991775 %C A201142 ..1...51....758....13009....120096....1268728......8360853......58395657 %C A201142 ..6..848..35810...593543...4264060....8360853....543067656...11302225941 %C A201142 .15.1189...4788..2004404..46991775...58395657..11302225941..126701693572 %C A201142 .20..120.182640...480902.263910168..309819522.110916509158...83500574989 %C A201142 .15.2596..18486.17798640.769159517.1599103606.542120293937.9901442852486 %H A201142 R. H. Hardin, Table of n, a(n) for n = 1..177 %F A201142 T(n,1) = binomial(6,n modulo 6). For a 0..z array, T(n,1) = binomial(z+1, n modulo (z+1)). %e A201142 Some solutions for n=3 k=7 %e A201142 ..0..0..0..1..1..4..4....0..0..0..0..1..1..3....0..0..1..2..3..3..4 %e A201142 ..0..2..2..3..3..4..5....1..2..2..2..3..3..5....0..1..2..3..4..4..4 %e A201142 ..1..2..2..3..5..5..5....3..4..4..4..5..5..5....0..1..2..3..5..5..5 %K A201142 nonn,tabl %O A201142 1,1 %A A201142 _R. H. Hardin_ Nov 27 2011 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE