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.

A161678 Sum of c mod k for k from (smallest prime factor of c) to (largest prime factor of c) where c is composite(n).

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 3
6 0
7 10
8 3
9 0
10 0
11 2
12 5
13 22
14 0
15 0
16 34
17 0
18 8
19 2
20 0
21 22
22 61
23 5
24 0
25 77
26 42
27 1
28 4
29 26
30 1
31 105
32 0
33 0
34 4
35 59
36 35
37 0
38 20
39 5
40 65
41 172
42 0
43 207
44 9
45 0
46 30
47 17
48 66
49 123
50 7
51 0
52 290
53 3
54 82
55 17
56 33
57 2
58 0
59 343
60 4
61 48
62 384
63 197
64 27
65 2
66 15
67 99
68 201
69 470
70 94
71 0
72 9
73 23
74 1
75 61
76 36
77 4
78 573
79 0

List of values

[0, 0, 0, 0, 3, 0, 10, 3, 0, 0, 2, 5, 22, 0, 0, 34, 0, 8, 2, 0, 22, 61, 5, 0, 77, 42, 1, 4, 26, 1, 105, 0, 0, 4, 59, 35, 0, 20, 5, 65, 172, 0, 207, 9, 0, 30, 17, 66, 123, 7, 0, 290, 3, 82, 17, 33, 2, 0, 343, 4, 48, 384, 197, 27, 2, 15, 99, 201, 470, 94, 0, 9, 23, 1, 61, 36, 4, 573, 0]