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.

A054025 Sum of divisors of n read modulo (number of divisors of n).

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 0
6 0
7 0
8 3
9 1
10 2
11 0
12 4
13 0
14 0
15 0
16 1
17 0
18 3
19 0
20 0
21 0
22 0
23 0
24 4
25 1
26 2
27 0
28 2
29 0
30 0
31 0
32 3
33 0
34 2
35 0
36 1
37 0
38 0
39 0
40 2
41 0
42 0
43 0
44 0
45 0
46 0
47 0
48 4
49 0
50 3
51 0
52 2
53 0
54 0
55 0
56 0
57 0
58 2
59 0
60 0
61 0
62 0
63 2
64 1
65 0
66 0
67 0
68 0
69 0
70 0
71 0
72 3
73 0
74 2
75 4
76 2
77 0
78 0
79 0
80 6
81 1
82 2
83 0
84 8
85 0
86 0
87 0
88 4
89 0
90 6
91 0
92 0
93 0
94 0
95 0
96 0
97 0
98 3
99 0
100 1
101 0
102 0
103 0
104 2
105 0

List of values

[0, 1, 0, 1, 0, 0, 0, 3, 1, 2, 0, 4, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 0, 4, 1, 2, 0, 2, 0, 0, 0, 3, 0, 2, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 4, 0, 3, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 3, 0, 2, 4, 2, 0, 0, 0, 6, 1, 2, 0, 8, 0, 0, 0, 4, 0, 6, 0, 0, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 2, 0]