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

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232663 Number of permutations of order n such that no proper partial sum is zero modulo n. 1
1, 1, 2, 12, 48, 280, 2040, 16632, 139440, 1404864, 15405120, 185361792, 2380777344, 33252800256, 495338598144 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..15.

K. Gaitanas, Avoiding multiples of p, MathOverflow.

FORMULA

For n>1, a(n) = A232664(n) * (n-1-(n mod 2)).

EXAMPLE

For n=4, in permutation (1,2,4,3), proper partial sums are 1, 1+2=3, 1+2+4=7, neither of which is zero modulo n. The number of such permutations is a(4)=12.

CROSSREFS

Sequence in context: A333728 A052569 A221663 * A052591 A029766 A088311

Adjacent sequences:  A232660 A232661 A232662 * A232664 A232665 A232666

KEYWORD

nonn,more

AUTHOR

Max Alekseyev, Nov 27 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 14:09 EST 2021. Contains 349445 sequences. (Running on oeis4.)