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.

A210485 Number T(n,k) of parts in all partitions of n in which no part occurs more than k times; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 1
5 3
6 0
7 3
8 3
9 6
10 0
11 3
12 8
13 8
14 12
15 0
16 5
17 11
18 15
19 15
20 20
21 0
22 8
23 17
24 24
25 29
26 29
27 35
28 0
29 10
30 23
31 36
32 41
33 47
34 47
35 54
36 0
37 13
38 36
39 50
40 65
41 71
42 78
43 78
44 86
45 0
46 18
47 48
48 75
49 91
50 104
51 111
52 119
53 119
54 128
55 0
56 25
57 69
58 102
59 132
60 150
61 165
62 173
63 182
64 182
65 192

List of values

[0, 0, 1, 0, 1, 3, 0, 3, 3, 6, 0, 3, 8, 8, 12, 0, 5, 11, 15, 15, 20, 0, 8, 17, 24, 29, 29, 35, 0, 10, 23, 36, 41, 47, 47, 54, 0, 13, 36, 50, 65, 71, 78, 78, 86, 0, 18, 48, 75, 91, 104, 111, 119, 119, 128, 0, 25, 69, 102, 132, 150, 165, 173, 182, 182, 192]