The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #20 Nov 30 2013 21:49:59
%S 1,1,2,12,48,280,2040,16632,139440,1404864,15405120,185361792,
%T 2380777344,33252800256,495338598144
%N Number of permutations of order n such that no proper partial sum is zero modulo n.
%H K. Gaitanas, <a href="http://mathoverflow.net/questions/149998/avoiding-multiples-of-p">Avoiding multiples of p</a>, MathOverflow.
%F For n>1, a(n) = A232664(n) * (n-1-(n mod 2)).
%e 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.
%K nonn,more
%O 1,3
%A _Max Alekseyev_, Nov 27 2013