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.

A175494 a(n) = floor(n^(1/d(n))), where d(n) = number of divisors of n.

Table of values

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

List of values

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