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.

A327632 Number T(n,k) of parts in all proper k-times partitions of n into distinct parts; triangle T(n,k), n >= 1, 0 <= k <= max(0,n-2), read by rows.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 2
7 3
8 1
9 4
10 6
11 4
12 1
13 7
14 13
15 12
16 5
17 1
18 9
19 30
20 52
21 35
22 6
23 1
24 12
25 61
26 137
27 156
28 72
29 7
30 1
31 17
32 121
33 384
34 638
35 548
36 196
37 8
38 1
39 24
40 210
41 880
42 1983
43 2442
44 1543
45 400
46 9
47 1
48 29
49 353
50 2012
51 6211
52 10865
53 10555
54 5231
55 1026
56 10
57 1
58 39
59 600
60 4477
61 17883
62 40855
63 54279
64 40511
65 15178
66 2070
67 11

List of values

[1, 1, 1, 2, 1, 2, 3, 1, 4, 6, 4, 1, 7, 13, 12, 5, 1, 9, 30, 52, 35, 6, 1, 12, 61, 137, 156, 72, 7, 1, 17, 121, 384, 638, 548, 196, 8, 1, 24, 210, 880, 1983, 2442, 1543, 400, 9, 1, 29, 353, 2012, 6211, 10865, 10555, 5231, 1026, 10, 1, 39, 600, 4477, 17883, 40855, 54279, 40511, 15178, 2070, 11]