cp's OEIS Frontend

A264701 Number of n X 1 arrays of permutations of 0..n-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 6.

%I A264701 #23 Jan 20 2021 20:50:32
%S A264701 1,1,1,1,1,1,2,4,8,16,32,64,192,576,1728,5184,15552,46656,186624,
%T A264701 746496,2985984,11943936,47775744,191102976,955514880,4777574400,
%U A264701 23887872000,119439360000,597196800000,2985984000000,17915904000000,107495424000000,644972544000000
%N A264701 Number of n X 1 arrays of permutations of 0..n-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 6.
%C A264701 Column 1 of A264704.
%H A264701 R. H. Hardin, <a href="/A264701/b264701.txt">Table of n, a(n) for n = 1..84</a>
%F A264701 a(n) = Product_{i=0..5} floor((n+i)/6)!. - _Alois P. Heinz_, Jul 12 2016
%F A264701 a(n) ~ (2*Pi*n)^(5/2) * n! / 6^(n + 3). - _Vaclav Kotesovec_, Oct 02 2018
%e A264701 All solutions for n=8
%e A264701 ..6....6....0....0
%e A264701 ..0....0....6....6
%e A264701 ..7....1....1....7
%e A264701 ..1....7....7....1
%e A264701 ..2....2....2....2
%e A264701 ..3....3....3....3
%e A264701 ..4....4....4....4
%e A264701 ..5....5....5....5
%t A264701 Table[Product[Floor[(n + i)/6]!, {i, 0, 5}], {n, 1, 40}] (* _Vaclav Kotesovec_, Oct 02 2018 *)
%Y A264701 Cf. A264704.
%Y A264701 Column k=6 of A275062.
%K A264701 nonn
%O A264701 1,7
%A A264701 _R. H. Hardin_, Nov 21 2015