|
|
A173499
|
|
Number of sequences of length n with terms from {0,1,...,n-1} such that the sum of terms is 0 modulo n and the i-th term is not i.
|
|
3
|
|
|
0, 0, 2, 20, 204, 2604, 39990, 720600, 14913080, 348678440, 9090909090, 261535698060, 8230246567620, 281241170407092, 10371206370520814, 410525522232055664, 17361641481138401520, 781282469559318055056
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
FORMULA
|
For odd n, a(n) = ((n-1)^n-n+1)/n.
For even n, a(n) = ((n-1)^n-1)/n.
|
|
PROG
|
(Python)
for n in range(1, 33):
print((n-1)**n // n, end=', ')
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|