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.

A096765 Number of partitions of n into distinct parts, the least being 1.

Table of values

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

List of values

[0, 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]