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.

A024934 Sum of remainders n mod p, over all primes p < n.

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 3
6 1
7 4
8 6
9 7
10 4
11 8
12 8
13 13
14 10
15 8
16 12
17 18
18 20
19 27
20 28
21 26
22 21
23 29
24 33
25 37
26 31
27 37
28 37
29 46
30 46
31 56
32 65
33 62
34 54
35 53
36 59
37 70
38 61
39 57
40 62
41 74
42 75
43 88
44 89
45 95
46 84
47 98
48 108
49 116
50 124
51 119
52 119
53 134
54 145
55 145
56 152
57 146
58 131
59 147
60 154
61 171
62 156
63 164
64 180
65 180
66 182
67 200
68 200
69 193
70 198
71 217

List of values

[0, 0, 0, 1, 1, 3, 1, 4, 6, 7, 4, 8, 8, 13, 10, 8, 12, 18, 20, 27, 28, 26, 21, 29, 33, 37, 31, 37, 37, 46, 46, 56, 65, 62, 54, 53, 59, 70, 61, 57, 62, 74, 75, 88, 89, 95, 84, 98, 108, 116, 124, 119, 119, 134, 145, 145, 152, 146, 131, 147, 154, 171, 156, 164, 180, 180, 182, 200, 200, 193, 198, 217]

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

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