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.

A331178 Number of values of k, 1 <= k <= n, with A023900(k) = A023900(n), where A023900 is Dirichlet inverse of Euler totient function phi.

Table of values

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

List of values

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