The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A173499 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

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.
(history; published version)

#17 by Peter Luschny at Mon Mar 23 09:16:23 EDT 2020

STATUS

reviewed

approved

#16 by Joerg Arndt at Mon Mar 23 06:32:11 EDT 2020

STATUS

proposed

reviewed

#15 by Michel Marcus at Mon Mar 23 03:48:00 EDT 2020

STATUS

editing

proposed

#14 by Michel Marcus at Mon Mar 23 03:47:55 EDT 2020

LINKS

ArtOfProblemSolving forum, <a href="http://www.artofproblemsolving.com/Forum/viewtopic.php?t=31946">Discussion at ArtOfProblemSolving forum45th IMO Team Selection Test Lincoln, Nebraska</a>

STATUS

proposed

editing

#13 by F. Chapoton at Mon Mar 23 03:43:52 EDT 2020

STATUS

editing

proposed

#12 by F. Chapoton at Mon Mar 23 03:43:37 EDT 2020

PROG

for n in range(1, 33):

print ((n-1)**n // n, end=', ')

STATUS

approved

editing

Discussion

Mon Mar 23

03:43

F. Chapoton: adapt python code to python 3

#11 by Max Alekseyev at Tue Aug 07 12:48:24 EDT 2012

STATUS

editing

approved

#10 by Max Alekseyev at Tue Aug 07 12:48:18 EDT 2012

NAME

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 modulo n.

LINKS

<a href="http://www.mathlinksartofproblemsolving.rocom/Forum/viewtopic.php?t=31946">Discussion at Mathlinks.RoArtOfProblemSolving forum</a>

STATUS

approved

editing

#9 by N. J. A. Sloane at Sat Aug 04 23:48:48 EDT 2012

STATUS

proposed

approved

#8 by Alex Ratushnyak at Sat Aug 04 22:48:18 EDT 2012

STATUS

editing

proposed