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.

A286627 a(n) = exponent of the highest power of A000005(n) (number of divisors of n) dividing A000010(n) (totient function phi), a(1) = 1.

Table of values

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

List of values

[1, 0, 1, 0, 2, 0, 1, 1, 1, 1, 1, 0, 2, 0, 1, 0, 4, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 2, 1, 1, 0, 1, 2, 1, 0, 2, 0, 1, 1, 3, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 1, 1, 1, 1, 0, 2, 0, 2, 0, 2, 0, 1, 0, 1, 1, 1, 1, 3, 1, 0, 2, 1, 1, 1, 0, 0, 1, 1, 1, 3, 0, 1, 1, 3, 1, 1, 0, 1, 0, 1, 0, 5, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 4, 0, 1, 0, 2, 0, 2, 1, 0]