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.

A337345 Number of divisors d of n for which A003961(d) > 2*d, where A003961 is fully multiplicative with a(p) = nextprime(p).

Table of values

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

List of values

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