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.

A026830 Number of partitions of n into distinct parts, the least being 9.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 1
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 1
30 2
31 2
32 3
33 3
34 4
35 4
36 5
37 5
38 6
39 6
40 7
41 7
42 9
43 9
44 11
45 12
46 14
47 15
48 18
49 19
50 22
51 24
52 27
53 29
54 33
55 36
56 40
57 44
58 49
59 54
60 60
61 66
62 73
63 81
64 89
65 98
66 108
67 119
68 130
69 144
70 157
71 173
72 189
73 208
74 227
75 250
76 272
77 299
78 326
79 358
80 389

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 9, 9, 11, 12, 14, 15, 18, 19, 22, 24, 27, 29, 33, 36, 40, 44, 49, 54, 60, 66, 73, 81, 89, 98, 108, 119, 130, 144, 157, 173, 189, 208, 227, 250, 272, 299, 326, 358, 389]