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.

A383093 Number of integer partitions of n that can be partitioned into constant blocks with a common sum.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 2
6 7
7 2
8 9
9 5
10 9
11 2
12 23
13 2
14 11
15 10
16 24
17 2
18 33
19 2
20 36
21 12
22 15
23 2
24 87
25 7
26 17
27 17
28 53
29 2
30 96
31 2
32 79
33 16
34 21
35 14
36 196
37 2
38 23
39 18
40 154
41 2
42 166
43 2
44 99
45 54
46 27
47 2
48 431
49 9
50 85
51 22
52 128
53 2
54 303
55 18
56 261
57 24
58 33
59 2
60 771
61 2
62 35
63 73
64 331
65 20
66 422
67 2
68 198
69 28
70 216
71 2
72 1369

List of values

[1, 1, 2, 2, 4, 2, 7, 2, 9, 5, 9, 2, 23, 2, 11, 10, 24, 2, 33, 2, 36, 12, 15, 2, 87, 7, 17, 17, 53, 2, 96, 2, 79, 16, 21, 14, 196, 2, 23, 18, 154, 2, 166, 2, 99, 54, 27, 2, 431, 9, 85, 22, 128, 2, 303, 18, 261, 24, 33, 2, 771, 2, 35, 73, 331, 20, 422, 2, 198, 28, 216, 2, 1369]