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.

A336099 Number of solutions of the equation k = n*sopf(k) in positive integers where sopf(k) is the sum of distinct prime factors of k.

Table of values

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

List of values

[1, 2, 1, 2, 1, 3, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 4, 1, 2, 1, 3, 1, 2, 2, 2, 1, 2, 1, 4, 1, 2, 2, 2, 1, 3, 2, 1, 1, 2, 1, 4, 1, 1, 0, 3, 1, 3, 1, 1, 2, 2, 1, 0, 1, 2, 2, 4, 1, 1, 2, 2, 1, 1, 1, 4, 2, 1, 1, 5, 1, 2, 2, 1, 2, 1, 1, 2, 1]