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.

A337976 Number of partitions of n into two distinct parts (s,t), such that s | t, (t-s) | n, and where n/(t-s) <= s < t.

Table of values

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

List of values

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