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.

A366281 a(n) = largest exponent m for which a representation of the form A366275(n) = k^m exists (for some k). a(0) = 0 by convention.

Table of values

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

List of values

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