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.

A026794 Triangular array T read by rows: T(n,k) = number of partitions of n in which least part is k, 1<=k<=n.

Table of values

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

List of values

[1, 1, 1, 2, 0, 1, 3, 1, 0, 1, 5, 1, 0, 0, 1, 7, 2, 1, 0, 0, 1, 11, 2, 1, 0, 0, 0, 1, 15, 4, 1, 1, 0, 0, 0, 1, 22, 4, 2, 1, 0, 0, 0, 0, 1, 30, 7, 2, 1, 1, 0, 0, 0, 0, 1, 42, 8, 3, 1, 1, 0, 0, 0, 0, 0, 1, 56, 12, 4, 2, 1, 1, 0, 0, 0, 0, 0, 1, 77, 14, 5, 2, 1, 1, 0, 0, 0, 0, 0, 0, 1, 101, 21, 6, 3, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1]