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.

A326849 Number of integer partitions of n whose length times maximum is a multiple of n.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 3
5 2
6 6
7 2
8 5
9 5
10 10
11 2
12 19
13 2
14 18
15 26
16 24
17 2
18 55
19 2
20 87
21 82
22 60
23 2
24 207
25 86
26 106
27 192
28 363
29 2
30 668
31 2
32 527
33 616
34 304
35 928
36 1827
37 2
38 498
39 1518
40 3229
41 2
42 4294
43 2
44 4445
45 6307
46 1266
47 2
48 11560
49 3629
50 8280
51 7802
52 13633
53 2
54 19120
55 18938
56 31385
57 16618
58 4584

List of values

[1, 1, 2, 2, 3, 2, 6, 2, 5, 5, 10, 2, 19, 2, 18, 26, 24, 2, 55, 2, 87, 82, 60, 2, 207, 86, 106, 192, 363, 2, 668, 2, 527, 616, 304, 928, 1827, 2, 498, 1518, 3229, 2, 4294, 2, 4445, 6307, 1266, 2, 11560, 3629, 8280, 7802, 13633, 2, 19120, 18938, 31385, 16618, 4584]