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.

A006141 Number of integer partitions of n whose smallest part is equal to the number of parts.

Table of values

n a(n)
1 1
2 0
3 0
4 1
5 1
6 1
7 1
8 1
9 2
10 2
11 3
12 3
13 4
14 4
15 5
16 6
17 7
18 8
19 10
20 11
21 13
22 15
23 17
24 19
25 23
26 25
27 29
28 33
29 38
30 42
31 49
32 54
33 62
34 69
35 78
36 87
37 99
38 109
39 123
40 137
41 154
42 170
43 191
44 211
45 236
46 261
47 290
48 320
49 357
50 392
51 435
52 479
53 530
54 582
55 644
56 706
57 779
58 854
59 940
60 1029
61 1133
62 1237
63 1358
64 1485

List of values

[1, 0, 0, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 15, 17, 19, 23, 25, 29, 33, 38, 42, 49, 54, 62, 69, 78, 87, 99, 109, 123, 137, 154, 170, 191, 211, 236, 261, 290, 320, 357, 392, 435, 479, 530, 582, 644, 706, 779, 854, 940, 1029, 1133, 1237, 1358, 1485]