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.

A353282 a(n) is the number of solutions (x,y) to the Diophantine equation S(x,y) = (x+y) + (x-y) + (x*y) + (x/y) = A013929(n) when x >= y > 1 and y | x.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 3, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 3, 3, 1, 3, 1, 1, 2, 1, 3, 1, 2, 3, 1]