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.

A025148 Number of partitions of n into distinct parts >= 3.

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 1
6 1
7 2
8 2
9 3
10 3
11 4
12 5
13 6
14 7
15 9
16 10
17 12
18 15
19 17
20 20
21 24
22 28
23 32
24 38
25 44
26 51
27 59
28 68
29 78
30 91
31 103
32 118
33 136
34 155
35 176
36 201
37 228
38 259
39 294
40 332
41 375
42 425
43 478
44 538
45 607
46 681
47 764
48 858
49 961
50 1075
51 1203
52 1343
53 1499
54 1673
55 1863
56 2073
57 2308
58 2564
59 2847
60 3161
61 3504

List of values

[1, 0, 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 9, 10, 12, 15, 17, 20, 24, 28, 32, 38, 44, 51, 59, 68, 78, 91, 103, 118, 136, 155, 176, 201, 228, 259, 294, 332, 375, 425, 478, 538, 607, 681, 764, 858, 961, 1075, 1203, 1343, 1499, 1673, 1863, 2073, 2308, 2564, 2847, 3161, 3504]