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.

A319311 Number of ordered pairs (i,j) with 0 < i < j < prime(n)/2 such that (i^2 mod prime(n)) > (j^2 mod prime(n)).

Table of values

n a(n)
2 0
3 0
4 1
5 4
6 3
7 9
8 14
9 22
10 28
11 40
12 53
13 73
14 86
15 101
16 116
17 168
18 153
19 234
20 260
21 246
22 299
23 362
24 365
25 435
26 523
27 583
28 612
29 559
30 652
31 835
32 952
33 918
34 1022
35 1154
36 1286
37 1237
38 1486
39 1554
40 1489
41 1730
42 1694
43 1975
44 1889
45 2078
46 2241
47 2520
48 2672
49 2996
50 2784
51 2892
52 3148
53 3058
54 3488
55 3570
56 4023
57 3881
58 4222
59 4087
60 4363

List of values

[0, 0, 1, 4, 3, 9, 14, 22, 28, 40, 53, 73, 86, 101, 116, 168, 153, 234, 260, 246, 299, 362, 365, 435, 523, 583, 612, 559, 652, 835, 952, 918, 1022, 1154, 1286, 1237, 1486, 1554, 1489, 1730, 1694, 1975, 1889, 2078, 2241, 2520, 2672, 2996, 2784, 2892, 3148, 3058, 3488, 3570, 4023, 3881, 4222, 4087, 4363]