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.

A326843 Number of integer partitions of n whose length and maximum both divide n.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 2
6 5
7 2
8 5
9 3
10 5
11 2
12 22
13 2
14 5
15 11
16 16
17 2
18 36
19 2
20 46
21 22
22 5
23 2
24 209
25 3
26 5
27 42
28 130
29 2
30 434
31 2
32 217
33 77
34 5
35 52
36 1400
37 2
38 5
39 135
40 1749
41 2
42 1782
43 2
44 957
45 2151
46 5
47 2
48 8355
49 3
50 1859
51 385
52 2388
53 2
54 6726
55 2765
56 10641
57 627
58 5
59 2
60 68049
61 2
62 5
63 13424
64 17142

List of values

[1, 1, 2, 2, 3, 2, 5, 2, 5, 3, 5, 2, 22, 2, 5, 11, 16, 2, 36, 2, 46, 22, 5, 2, 209, 3, 5, 42, 130, 2, 434, 2, 217, 77, 5, 52, 1400, 2, 5, 135, 1749, 2, 1782, 2, 957, 2151, 5, 2, 8355, 3, 1859, 385, 2388, 2, 6726, 2765, 10641, 627, 5, 2, 68049, 2, 5, 13424, 17142]