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.

A292286 a(n) = k if the product of the divisors of n is n^k for some integer k, or -1 if no such k exists. For the ambiguous case, define a(1) = 0.

Table of values

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

List of values

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