login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A275064
Number of permutations p of [n] such that p(i)-i is a multiple of nine for all i in [n].
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1536, 4608, 13824, 41472, 124416, 373248, 1119744, 3359232, 10077696, 40310784, 161243136, 644972544, 2579890176, 10319560704, 41278242816, 165112971264, 660451885056, 2641807540224
OFFSET
0,11
LINKS
FORMULA
a(n) = Product_{i=0..8} floor((n+i)/9)!.
a(n) ~ (2*Pi*n)^4 * n! / 9^(n + 9/2). - Vaclav Kotesovec, Oct 02 2018
MATHEMATICA
Table[Product[Floor[(n + i)/9]!, {i, 0, 8}], {n, 0, 40}] (* Vaclav Kotesovec, Oct 02 2018 *)
CROSSREFS
Column k=9 of A275062.
Sequence in context: A180212 A274862 A275076 * A238938 A103662 A180211
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Jul 15 2016
STATUS
approved