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.

A173500 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 or 2i modulo n.

Table of values

n a(n)
1 0
2 0
3 0
4 6
5 64
6 854
7 13392
8 244944
9 5124266
10 120795956
11 3169804000
12 91666666668
13 2897010809280
14 99350833566282
15 3674884626652666
16 145845089585448960
17 6182031393612132352
18 278750799336055446646
19 13322922112485213149376

List of values

[0, 0, 0, 6, 64, 854, 13392, 244944, 5124266, 120795956, 3169804000, 91666666668, 2897010809280, 99350833566282, 3674884626652666, 145845089585448960, 6182031393612132352, 278750799336055446646, 13322922112485213149376]