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.

A116608 Triangle read by rows: T(n,k) is number of partitions of n having k distinct parts (n>=1, k>=1).

Table of values

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

List of values

[1, 2, 2, 1, 3, 2, 2, 5, 4, 6, 1, 2, 11, 2, 4, 13, 5, 3, 17, 10, 4, 22, 15, 1, 2, 27, 25, 2, 6, 29, 37, 5, 2, 37, 52, 10, 4, 44, 67, 20, 4, 44, 97, 30, 1, 5, 55, 117, 52, 2, 2, 59, 154, 77, 5, 6, 68, 184, 117, 10, 2, 71, 235, 162, 20, 6, 81, 277, 227, 36, 4, 82, 338, 309, 58, 1]