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.

A025147 Number of partitions of n into distinct parts >= 2.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 2
6 2
7 3
8 3
9 5
10 5
11 7
12 8
13 10
14 12
15 15
16 17
17 21
18 25
19 29
20 35
21 41
22 48
23 56
24 66
25 76
26 89
27 103
28 119
29 137
30 159
31 181
32 209
33 239
34 273
35 312
36 356
37 404
38 460
39 522
40 591
41 669
42 757
43 853
44 963
45 1085
46 1219
47 1371
48 1539
49 1725
50 1933
51 2164
52 2418
53 2702
54 3016
55 3362
56 3746
57 4171
58 4637
59 5155

List of values

[1, 0, 1, 1, 1, 2, 2, 3, 3, 5, 5, 7, 8, 10, 12, 15, 17, 21, 25, 29, 35, 41, 48, 56, 66, 76, 89, 103, 119, 137, 159, 181, 209, 239, 273, 312, 356, 404, 460, 522, 591, 669, 757, 853, 963, 1085, 1219, 1371, 1539, 1725, 1933, 2164, 2418, 2702, 3016, 3362, 3746, 4171, 4637, 5155]