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.

A352834 Least k > 0 such that denominator( d(k*n)/(k*n) ) = n, or 0 if no such k exists, where d = A000005 is the number-of-divisors function.

Table of values

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

List of values

[1, 4, 1, 1, 1, 12, 1, 10, 12, 2, 1, 20, 1, 2, 1, 1, 1, 0, 1, 24, 1, 2, 1, 2, 1, 2, 1, 20, 1, 0, 1, 14, 1, 2, 1, 24, 1, 2, 1, 4, 1, 40, 1, 20, 12, 2, 1, 3, 1, 4, 1, 20, 1, 18, 1, 2, 1, 2, 1, 32, 1, 2, 12, 1, 1, 40, 1, 20, 1, 48, 1, 0, 1, 2, 36, 20, 1, 40, 1, 5, 1, 2, 1, 4, 1, 2, 1, 2, 1, 48]