login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264692 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 5. 4

%I #3 Nov 21 2015 07:31:12

%S 1,1,1,1,1,1,2,7,6,1,4,56,80,23,1,8,348,3196,2051,84,2,24,4672,171962,

%T 465584,59845,897,4,72,93864,17647792,207022624,110630784,3406328,

%U 9292,8,216,1776576,2685878592

%N T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 5.

%C Table starts

%C .1....1.......1.........2.........4........8.........24......72.216

%C .1....1.......7........56.......348.....4672......93864.1776576

%C .1....6......80......3196....171962.17647792.2685878592

%C .1...23....2051....465584.207022624

%C .1...84...59845.110630784

%C .2..897.3406328

%C .4.9292

%e Some solutions for n=3 k=4

%e ..6..0.10..5....0.10..1.11....0..3..1.10...10..2..5.11....0..7.10.11

%e ..3..1.11..2....6..5..8..2....6..9.11..5....0..4..1..7....6..3..5..2

%e ..9..7..4..8....3..9..4..7....7..4..2..8....3..9..6..8....9..4..1..8

%Y Column 1 is A264656.

%Y Row 1 is A264557.

%K nonn,tabl

%O 1,7

%A _R. H. Hardin_, Nov 21 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)