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!)
A275063 Number of permutations p of [n] such that p(i)-i is a multiple of eight for all i in [n]. 2
1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 8, 16, 32, 64, 128, 256, 768, 2304, 6912, 20736, 62208, 186624, 559872, 1679616, 6718464, 26873856, 107495424, 429981696, 1719926784, 6879707136, 27518828544, 110075314176, 550376570880, 2751882854400, 13759414272000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
LINKS
FORMULA
a(n) = Product_{i=0..7} floor((n+i)/8)!.
a(n) ~ (2*Pi*n)^(7/2) * n! / 8^(n + 4). - Vaclav Kotesovec, Oct 02 2018
EXAMPLE
a(9) = 2: 123456789, 923456781.
MATHEMATICA
Table[Product[Floor[(n + i)/8]!, {i, 0, 7}], {n, 0, 40}] (* Vaclav Kotesovec, Oct 02 2018 *)
CROSSREFS
Column k=8 of A275062.
Sequence in context: A103662 A180211 A275075 * A186026 A367653 A023423
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)