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.

A116685 Triangle read by rows: T(n,k) is number of partitions of n that have k parts smaller than the largest part (n>=1, k>=0).

Table of values

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

List of values

[1, 2, 2, 1, 3, 1, 1, 2, 3, 1, 1, 4, 2, 3, 1, 1, 2, 5, 3, 3, 1, 1, 4, 4, 6, 3, 3, 1, 1, 3, 6, 6, 7, 3, 3, 1, 1, 4, 6, 10, 7, 7, 3, 3, 1, 1, 2, 9, 10, 12, 8, 7, 3, 3, 1, 1, 6, 6, 15, 14, 13, 8, 7, 3, 3, 1, 1, 2, 11, 15, 20, 16, 14, 8, 7, 3, 3, 1, 1, 4, 10, 21, 22, 24, 17, 14, 8, 7, 3, 3, 1, 1, 4, 11, 21]