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.

A091602 Triangle: T(n,k) is the number of partitions of n such that some part is repeated k times and no part is repeated more than k times.

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