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.

A054008 n read modulo (number of divisors of n).

Table of values

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

List of values

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