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.

A096144 Triangle T(n,k) = number of partitions of n in which the least part occurs exactly k times, k=1..n.

Table of values

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

List of values

[1, 1, 1, 2, 0, 1, 2, 2, 0, 1, 4, 1, 1, 0, 1, 4, 3, 2, 1, 0, 1, 7, 3, 2, 1, 1, 0, 1, 8, 6, 2, 3, 1, 1, 0, 1, 12, 5, 6, 2, 2, 1, 1, 0, 1, 14, 11, 5, 4, 3, 2, 1, 1, 0, 1, 21, 11, 8, 5, 4, 2, 2, 1, 1, 0, 1, 24, 17, 11, 9, 4, 5, 2, 2, 1, 1, 0, 1, 34, 20, 15, 9, 8, 4, 4, 2, 2, 1, 1, 0, 1, 41, 30, 18, 14, 9, 7, 5, 4, 2, 2, 1, 1, 0, 1]