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!)
A264701 Number of n X 1 arrays of permutations of 0..n-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 6. 6
1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 192, 576, 1728, 5184, 15552, 46656, 186624, 746496, 2985984, 11943936, 47775744, 191102976, 955514880, 4777574400, 23887872000, 119439360000, 597196800000, 2985984000000, 17915904000000, 107495424000000, 644972544000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
COMMENTS
Column 1 of A264704.
LINKS
FORMULA
a(n) = Product_{i=0..5} floor((n+i)/6)!. - Alois P. Heinz, Jul 12 2016
a(n) ~ (2*Pi*n)^(5/2) * n! / 6^(n + 3). - Vaclav Kotesovec, Oct 02 2018
EXAMPLE
All solutions for n=8
..6....6....0....0
..0....0....6....6
..7....1....1....7
..1....7....7....1
..2....2....2....2
..3....3....3....3
..4....4....4....4
..5....5....5....5
MATHEMATICA
Table[Product[Floor[(n + i)/6]!, {i, 0, 5}], {n, 1, 40}] (* Vaclav Kotesovec, Oct 02 2018 *)
CROSSREFS
Cf. A264704.
Column k=6 of A275062.
Sequence in context: A180209 A344493 A275073 * A195904 A101333 A367652
KEYWORD
nonn
AUTHOR
R. H. Hardin, Nov 21 2015
STATUS
approved

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 19 16:52 EDT 2024. Contains 371794 sequences. (Running on oeis4.)