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.

A345047 a(n) = A003958(n) / A345046(n), where A003958(n) is multiplicative with a(p^e) = (p-1)^e, and A345046(n) gives the least common multiple of the same factors.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 4, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 4, 1, 2, 1, 1, 4, 6, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 4]