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.

A116687 Triangle read by rows: T(n,k) is the number of partitions of n for which the sum of the parts that are smaller than the largest part is equal to k (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 2
10 2
11 1
12 4
13 1
14 3
15 2
16 1
17 2
18 3
19 2
20 4
21 3
22 1
23 4
24 1
25 5
26 3
27 5
28 3
29 1
30 3
31 3
32 2
33 6
34 5
35 6
36 4
37 1
38 4
39 2
40 5
41 3
42 9
43 6
44 8
45 4
46 1
47 2
48 3
49 4
50 7
51 5
52 11
53 9
54 9
55 5
56 1
57 6
58 1
59 5
60 5
61 10
62 7
63 15
64 11
65 11
66 5
67 1
68 2
69 5
70 2
71 7
72 8
73 13
74 11
75 18
76 15
77 13
78 6
79 1
80 4
81 1
82 9
83 3
84 11
85 10
86 19
87 14
88 24
89 18
90 15
91 6
92 1
93 4
94 3
95 2
96 12
97 5

List of values

[1, 2, 2, 1, 3, 1, 1, 2, 2, 2, 1, 4, 1, 3, 2, 1, 2, 3, 2, 4, 3, 1, 4, 1, 5, 3, 5, 3, 1, 3, 3, 2, 6, 5, 6, 4, 1, 4, 2, 5, 3, 9, 6, 8, 4, 1, 2, 3, 4, 7, 5, 11, 9, 9, 5, 1, 6, 1, 5, 5, 10, 7, 15, 11, 11, 5, 1, 2, 5, 2, 7, 8, 13, 11, 18, 15, 13, 6, 1, 4, 1, 9, 3, 11, 10, 19, 14, 24, 18, 15, 6, 1, 4, 3, 2, 12, 5]