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!)
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.
a(n) = floor((n-1)^n / n). - From Alex Ratushnyak, Aug 04 2012.
PROG
(Python)
for n in range(1, 33):
print((n-1)**n // n, end=', ')
# from Alex Ratushnyak, Aug 04 2012
CROSSREFS
Sequence in context: A037729 A037624 A077327 * A067636 A226301 A000906
KEYWORD
nonn
AUTHOR
Max Alekseyev, Feb 20 2010
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 February 24 17:05 EST 2024. Contains 370307 sequences. (Running on oeis4.)