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.

A054009 n read modulo (number of proper divisors of n).

Table of values

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

List of values

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