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.

A080847 a(n) = mu(n)+2, where mu is the Moebius function (A008683).

Table of values

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

List of values

[3, 1, 1, 2, 1, 3, 1, 2, 2, 3, 1, 2, 1, 3, 3, 2, 1, 2, 1, 2, 3, 3, 1, 2, 2, 3, 2, 2, 1, 1, 1, 2, 3, 3, 3, 2, 1, 3, 3, 2, 1, 1, 1, 2, 2, 3, 1, 2, 2, 2, 3, 2, 1, 2, 3, 2, 3, 3, 1, 2, 1, 3, 2, 2, 3, 1, 1, 2, 3, 1, 1, 2, 1, 3, 2, 2, 3, 1, 1, 2, 2, 3, 1, 2, 3, 3, 3, 2, 1, 2, 3, 2, 3, 3, 3, 2, 1, 2, 2, 2, 1, 1, 1, 2, 1]