cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 0
2 0
3 2
4 20
5 204
6 2604
7 39990
8 720600
9 14913080
10 348678440
11 9090909090
12 261535698060
13 8230246567620
14 281241170407092
15 10371206370520814
16 410525522232055664
17 17361641481138401520
18 781282469559318055056
19 37275544492386193492506
20 1879498672877297909667780
21 99864380952380952380952380

List of values

[0, 0, 2, 20, 204, 2604, 39990, 720600, 14913080, 348678440, 9090909090, 261535698060, 8230246567620, 281241170407092, 10371206370520814, 410525522232055664, 17361641481138401520, 781282469559318055056, 37275544492386193492506, 1879498672877297909667780, 99864380952380952380952380]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.