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.

A096401 Number of balanced partitions of n into distinct parts: least part is equal to number of parts.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 2
13 2
14 3
15 3
16 4
17 4
18 5
19 5
20 6
21 6
22 8
23 8
24 10
25 11
26 13
27 14
28 17
29 18
30 21
31 23
32 26
33 28
34 32
35 35
36 39
37 43
38 48
39 53
40 59
41 65
42 72
43 80
44 88
45 97
46 107
47 118
48 129
49 142
50 155
51 171
52 186
53 204
54 222
55 244
56 265
57 290
58 315
59 345
60 374
61 409
62 443
63 484
64 524
65 571
66 618
67 673
68 727
69 790

List of values

[1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 8, 8, 10, 11, 13, 14, 17, 18, 21, 23, 26, 28, 32, 35, 39, 43, 48, 53, 59, 65, 72, 80, 88, 97, 107, 118, 129, 142, 155, 171, 186, 204, 222, 244, 265, 290, 315, 345, 374, 409, 443, 484, 524, 571, 618, 673, 727, 790]