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.

A335438 Number of partitions of k_n into two distinct parts (s,t) such that k_n | s*t, where k_n = A335437(n).

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 1, 1, 3, 2, 2, 1, 4, 1, 1, 3, 1, 4, 2, 1, 1, 5, 2, 1, 3, 1, 5, 3, 2, 1, 1, 4, 6, 1, 2, 1, 2, 1, 3, 6, 1, 4, 1, 1, 2, 1, 7, 1, 1, 5, 4, 3, 2, 2, 7, 1, 1, 1, 2, 1, 5, 8, 3, 1, 4, 1, 1, 1, 3, 8, 2, 1, 1, 6, 1, 3, 2, 1, 1, 2, 9, 5, 1, 1, 2, 1, 3]