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.

A286628 a(n) = exponent of the highest power of A000005(n) (number of divisors of n) dividing A000203(n) (sum of divisors of n), a(1) = 1.

Table of values

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

List of values

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