The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..683 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 Adjacent sequences:  A275061 A275062 A275063 * A275065 A275066 A275067 KEYWORD nonn AUTHOR Alois P. Heinz, Jul 15 2016 STATUS approved

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.

Last modified May 15 13:20 EDT 2021. Contains 343920 sequences. (Running on oeis4.)