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.

A350889 Triangle T(n,k), n >= 1, 1 <= k <= n, read by rows, where T(n,k) is the number of partitions of n such that k*(smallest part) = (number of parts).

Table of values

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

List of values

[1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 3, 3, 2, 1, 1, 1, 2, 3, 4, 3, 2, 1, 1, 2, 2, 4, 5, 5, 3, 2, 1, 1, 2, 3, 4, 7, 6, 5, 3, 2, 1, 1, 3, 4, 5, 8, 9, 7, 5, 3, 2, 1, 1, 3, 5, 6, 10, 11, 10, 7, 5, 3, 2, 1, 1, 4, 6, 7, 12, 15, 13, 11, 7, 5, 3, 2, 1, 1, 4, 8, 8, 14, 18, 18, 14, 11, 7, 5, 3, 2, 1, 1]