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

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

%I

%S 1,1,1,2,3,1,4,28,16,1,12,400,960,128,2,36,7776,107568,46656,1152,4,

%T 144,229392,21565440,71663616,4561920,12960,8,576,9082368,10027929600,

%U 229132800000,98288640000,829440000,269568,16,2880,481406976

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

%C Table starts

%C ..1......1.........2...........4...........12..........36...........144

%C ..1......3........28.........400.........7776......229392.......9082368

%C ..1.....16.......960......107568.....21565440.10027929600.7163873280000

%C ..1....128.....46656....71663616.229132800000

%C ..2...1152...4561920.98288640000

%C ..4..12960.829440000

%C ..8.269568

%C .16

%H R. H. Hardin, <a href="/A264638/b264638.txt">Table of n, a(n) for n = 1..39</a>

%e Some solutions for n=3 k=4

%e ..4..8..1..9....0..4..8..1....0..4..5..1....0..2..5..3....4..8..6..0

%e ..0..6..2..5...10..2..7..9....2..8.11..9....8.10..1..7...10..9..7..5

%e .10..7.11..3....6.11..3..5....6.10..3..7....4..6..9.11....2..1.11..3

%Y Row 1 is A111942(n+1).

%K nonn,tabl

%O 1,4

%A _R. H. Hardin_, Nov 19 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.

Last modified May 21 19:42 EDT 2022. Contains 353929 sequences. (Running on oeis4.)