login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264557 Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 3. 6

%I

%S 1,1,1,2,4,8,24,72,216,864,3456,13824,69120,345600,1728000,10368000,

%T 62208000,373248000,2612736000,18289152000,128024064000,1024192512000,

%U 8193540096000,65548320768000,589934886912000,5309413982208000,47784725839872000

%N Number of n X 1 arrays of permutations of 0..n*1-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 3.

%C Column 1 of A264560.

%H R. H. Hardin, <a href="/A264557/b264557.txt">Table of n, a(n) for n = 1..48</a>

%F a(n) = Product_{i=0..2} ceiling((n-i)/3)!. - _Alois P. Heinz_, Jul 09 2016

%F a(n) ~ 2 * Pi * (n+1)! / 3^(n + 3/2). - _Vaclav Kotesovec_, Oct 02 2018

%e All solutions for n=4

%e ..0....3

%e ..3....0

%e ..1....1

%e ..2....2

%t Table[Product[Floor[(n + i)/3]!, {i, 0, 2}], {n, 1, 30}] (* _Vaclav Kotesovec_, Oct 02 2018 *)

%Y Cf. A264560.

%Y Column k=3 of A275062.

%K nonn

%O 1,4

%A _R. H. Hardin_, Nov 17 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 11:38 EDT 2019. Contains 324234 sequences. (Running on oeis4.)