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.

A054015 a(n) is Chowla function of n read modulo (number of proper divisors of n), a(1) = 0 by convention.

Table of values

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

List of values

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