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.

A341879 a(n) is the largest d(k) such that sigma(k) = n, where d is the number of divisor function and sigma is the sum of divisors function.

Table of values

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

List of values

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