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.

A270443 Least m such that d(n^m) > n, where d(n) is the number of divisors of n.

Table of values

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

List of values

[2, 3, 2, 5, 2, 7, 3, 5, 3, 11, 2, 13, 3, 3, 4, 17, 3, 19, 3, 4, 4, 23, 3, 13, 5, 9, 4, 29, 3, 31, 7, 5, 5, 5, 3, 37, 6, 6, 4, 41, 3, 43, 4, 5, 6, 47, 3, 25, 5, 7, 5, 53, 4, 7, 4, 7, 7, 59, 3, 61, 7, 5, 11, 8, 4, 67, 6, 8, 4, 71, 4, 73, 8, 6, 6, 8, 4, 79, 4, 21]