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.

A026829 Number of partitions of n into distinct parts, the least being 8.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 1
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 2
28 2
29 3
30 3
31 4
32 4
33 5
34 5
35 6
36 6
37 7
38 8
39 9
40 10
41 12
42 13
43 15
44 17
45 19
46 21
47 24
48 26
49 29
50 33
51 36
52 40
53 45
54 50
55 55
56 62
57 68
58 76
59 84
60 93
61 102
62 114
63 125
64 138
65 152
66 168
67 184
68 204
69 223
70 246
71 270
72 297
73 325
74 358
75 391
76 429
77 470

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8, 9, 10, 12, 13, 15, 17, 19, 21, 24, 26, 29, 33, 36, 40, 45, 50, 55, 62, 68, 76, 84, 93, 102, 114, 125, 138, 152, 168, 184, 204, 223, 246, 270, 297, 325, 358, 391, 429, 470]