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.

A378658 a(n) = A337345(A091191(n)), where A337345 is the number of divisors d of n for which A003961(d) > 2*d, and A091191 lists the primitive abundant numbers.

Table of values

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

List of values

[3, 3, 3, 4, 4, 5, 2, 4, 3, 4, 2, 4, 3, 3, 2, 2, 6, 2, 2, 2, 6, 2, 6, 6, 2, 2, 7, 2, 6, 2, 2, 2, 6, 2, 6, 2, 6, 2, 5, 5, 2, 2, 2, 2, 6, 5, 2, 2, 4, 2, 2, 6, 2, 2, 5, 6, 2, 2, 2, 12, 2, 8, 2, 6, 2, 2, 2, 2, 6, 2, 2, 8, 2, 6, 2, 8, 6, 2, 2, 2, 8, 2, 6, 2, 2, 6, 8, 2, 2, 13, 2, 2, 2, 6, 2, 2, 8, 2, 6, 2, 2, 2, 4, 6]