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.

A026825 Number of partitions of n into distinct parts, the least being 4.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 0
6 0
7 0
8 0
9 1
10 1
11 1
12 1
13 1
14 1
15 2
16 2
17 3
18 3
19 4
20 4
21 5
22 6
23 7
24 8
25 10
26 11
27 13
28 15
29 17
30 20
31 23
32 26
33 30
34 35
35 39
36 45
37 51
38 58
39 66
40 75
41 84
42 96
43 108
44 122
45 137
46 155
47 173
48 195
49 219
50 245
51 274
52 307
53 342
54 383
55 427
56 475
57 529
58 589
59 654
60 727
61 807
62 894
63 991
64 1098
65 1214
66 1343
67 1485
68 1638
69 1809

List of values

[0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 15, 17, 20, 23, 26, 30, 35, 39, 45, 51, 58, 66, 75, 84, 96, 108, 122, 137, 155, 173, 195, 219, 245, 274, 307, 342, 383, 427, 475, 529, 589, 654, 727, 807, 894, 991, 1098, 1214, 1343, 1485, 1638, 1809]