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.

A026821 Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts, the least being k, for k=1,2,...,n.

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 0
6 1
7 1
8 0
9 0
10 1
11 1
12 1
13 0
14 0
15 1
16 2
17 1
18 0
19 0
20 0
21 1
22 2
23 1
24 1
25 0
26 0
27 0
28 1
29 3
30 1
31 1
32 0
33 0
34 0
35 0
36 1
37 3
38 2
39 1
40 1
41 0
42 0
43 0
44 0
45 1
46 5
47 2
48 1
49 1
50 0
51 0
52 0
53 0
54 0
55 1
56 5
57 3
58 1
59 1
60 1
61 0
62 0
63 0
64 0
65 0
66 1
67 7
68 3
69 2
70 1
71 1
72 0
73 0
74 0
75 0
76 0
77 0
78 1
79 8
80 4
81 2
82 1
83 1
84 1
85 0
86 0
87 0
88 0
89 0
90 0

List of values

[1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 2, 1, 0, 0, 0, 1, 2, 1, 1, 0, 0, 0, 1, 3, 1, 1, 0, 0, 0, 0, 1, 3, 2, 1, 1, 0, 0, 0, 0, 1, 5, 2, 1, 1, 0, 0, 0, 0, 0, 1, 5, 3, 1, 1, 1, 0, 0, 0, 0, 0, 1, 7, 3, 2, 1, 1, 0, 0, 0, 0, 0, 0, 1, 8, 4, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0]