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.

A338117 Number of partitions of n into two parts (s,t) such that (t-s) | n, where s < t.

Table of values

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

List of values

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