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.

A243016 Number of solutions for k*n/(k+n) = p for integer k > 0 and prime p.

Table of values

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

List of values

[0, 0, 1, 2, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 2, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0]