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.

A338528 Number of partitions of k*n into two parts (s,t) such that s <= t and t | k*s for k = 1..n.

Table of values

n a(n)
1 0
2 2
3 2
4 5
5 4
6 11
7 7
8 13
9 11
10 19
11 11
12 27
13 15
14 28
15 30
16 34
17 20
18 45
19 23
20 52
21 46
22 49
23 28
24 71
25 45
26 58
27 54
28 78
29 37
30 105
31 42
32 81
33 77
34 79
35 85
36 124
37 51
38 90
39 91
40 137
41 57
42 156
43 61
44 134
45 143
46 115
47 67
48 178
49 102
50 160
51 128
52 162
53 75
54 187
55 150
56 206
57 144
58 143
59 84
60 276
61 91
62 156
63 213
64 199
65 181
66 263

List of values

[0, 2, 2, 5, 4, 11, 7, 13, 11, 19, 11, 27, 15, 28, 30, 34, 20, 45, 23, 52, 46, 49, 28, 71, 45, 58, 54, 78, 37, 105, 42, 81, 77, 79, 85, 124, 51, 90, 91, 137, 57, 156, 61, 134, 143, 115, 67, 178, 102, 160, 128, 162, 75, 187, 150, 206, 144, 143, 84, 276, 91, 156, 213, 199, 181, 263]