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.

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

Table of values

n a(n)
2 0
3 0
4 1
5 2
6 7
7 5
8 10
9 22
10 45
11 48
12 68
13 53
14 104
15 127
16 146
17 200
18 203
19 250
20 288
21 312
22 387
23 318
24 450
25 557
26 536
27 745
28 664
29 581
30 722
31 797
32 986
33 1011
34 1082
35 1474
36 1294
37 1317
38 1608
39 1684
40 1893
41 2096
42 1898
43 2297
44 2333
45 2090
46 2467
47 2652
48 2836
49 3352
50 3698
51 3326
52 3380
53 2981
54 3778
55 3902
56 4165
57 4743
58 4350
59 4652
60 4240

List of values

[0, 0, 1, 2, 7, 5, 10, 22, 45, 48, 68, 53, 104, 127, 146, 200, 203, 250, 288, 312, 387, 318, 450, 557, 536, 745, 664, 581, 722, 797, 986, 1011, 1082, 1474, 1294, 1317, 1608, 1684, 1893, 2096, 1898, 2297, 2333, 2090, 2467, 2652, 2836, 3352, 3698, 3326, 3380, 2981, 3778, 3902, 4165, 4743, 4350, 4652, 4240]

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

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