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.

A351690 a(n) is the number of n-subsets of [0..p-1] whose n*(n-1) differences are congruent to 1..p-1 (mod p), where p=n*(n-1)+1.

Table of values

n a(n)
1 1
2 3
3 14
4 52
5 42
6 310
7 0
8 684
9 584
10 1092
11 0
12 4788
13 0
14 7320
15 0
16 0
17 3276
18 31314
19 0
20 32004
21 0
22 0
23 0

List of values

[1, 3, 14, 52, 42, 310, 0, 684, 584, 1092, 0, 4788, 0, 7320, 0, 0, 3276, 31314, 0, 32004, 0, 0, 0]