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.

A321452 Number of integer partitions of n that can be partitioned into two or more blocks with equal sums.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 3
5 1
6 7
7 1
8 14
9 10
10 26
11 1
12 55
13 1
14 90
15 68
16 167
17 1
18 292
19 1
20 482
21 345
22 761
23 1
24 1291
25 266
26 1949
27 1518
28 3091
29 1
30 4793
31 1
32 7177
33 5612
34 10566
35 2623
36 16007
37 1
38 22912
39 18992
40 33619
41 1
42 48529
43 1
44 68758
45 59187
46 96571
47 1
48 137489
49 11418
50 189979
51 167502
52 264299

List of values

[0, 0, 1, 1, 3, 1, 7, 1, 14, 10, 26, 1, 55, 1, 90, 68, 167, 1, 292, 1, 482, 345, 761, 1, 1291, 266, 1949, 1518, 3091, 1, 4793, 1, 7177, 5612, 10566, 2623, 16007, 1, 22912, 18992, 33619, 1, 48529, 1, 68758, 59187, 96571, 1, 137489, 11418, 189979, 167502, 264299]