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.

A320260 Number of ordered pairs (j,k) with 0 < j < k < prime(n)/2 such that (j*(j+1) mod prime(n)) > (k*(k+1) mod prime(n)).

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 3
6 8
7 13
8 10
9 19
10 41
11 44
12 70
13 83
14 75
15 100
16 143
17 167
18 210
19 188
20 225
21 290
22 306
23 322
24 401
25 503
26 554
27 481
28 541
29 634
30 686
31 848
32 858
33 1048
34 981
35 1203
36 1099
37 1468
38 1332
39 1421
40 1700
41 1646
42 1831
43 2054
44 2077
45 2135
46 2017
47 2356
48 2698
49 2712
50 2851
51 3022
52 3112
53 3386
54 3447
55 3838
56 3551
57 4062
58 3956
59 4466
60 4569

List of values

[0, 0, 1, 1, 3, 8, 13, 10, 19, 41, 44, 70, 83, 75, 100, 143, 167, 210, 188, 225, 290, 306, 322, 401, 503, 554, 481, 541, 634, 686, 848, 858, 1048, 981, 1203, 1099, 1468, 1332, 1421, 1700, 1646, 1831, 2054, 2077, 2135, 2017, 2356, 2698, 2712, 2851, 3022, 3112, 3386, 3447, 3838, 3551, 4062, 3956, 4466, 4569]