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.

A172467 T(n,k) = number of summands in the partitions of n into k parts; a triangular array.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 3
7 1
8 4
9 3
10 4
11 1
12 4
13 6
14 4
15 5
16 1
17 6
18 9
19 8
20 5
21 6
22 1
23 6
24 12
25 12
26 10
27 6
28 7
29 1
30 8
31 15
32 20
33 15
34 12
35 7
36 8
37 1
38 8
39 21
40 24
41 25
42 18
43 14
44 8
45 9
46 1
47 10
48 24
49 36
50 35
51 30
52 21
53 16
54 9
55 10
56 1
57 10
58 30
59 44
60 50
61 42
62 35
63 24
64 18
65 10
66 11
67 1
68 12
69 36
70 60
71 65
72 66
73 49
74 40
75 27
76 20
77 11
78 12
79 1

List of values

[1, 1, 2, 1, 2, 3, 1, 4, 3, 4, 1, 4, 6, 4, 5, 1, 6, 9, 8, 5, 6, 1, 6, 12, 12, 10, 6, 7, 1, 8, 15, 20, 15, 12, 7, 8, 1, 8, 21, 24, 25, 18, 14, 8, 9, 1, 10, 24, 36, 35, 30, 21, 16, 9, 10, 1, 10, 30, 44, 50, 42, 35, 24, 18, 10, 11, 1, 12, 36, 60, 65, 66, 49, 40, 27, 20, 11, 12, 1]