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.

A116861 Triangle read by rows: T(n,k) is the number of partitions of n such that the sum of the parts, counted without multiplicities, is equal to k (n>=1, k>=1).

Table of values

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

List of values

[1, 1, 1, 1, 0, 2, 1, 1, 1, 2, 1, 0, 2, 1, 3, 1, 1, 3, 1, 1, 4, 1, 0, 3, 2, 2, 2, 5, 1, 1, 3, 3, 2, 4, 2, 6, 1, 0, 5, 2, 3, 4, 4, 3, 8, 1, 1, 4, 3, 4, 7, 4, 5, 3, 10, 1, 0, 5, 3, 4, 7, 7, 6, 6, 5, 12, 1, 1, 6, 4, 3, 12, 6, 8, 7, 9, 5, 15, 1, 0, 6, 4, 5, 10, 10, 9, 10, 11, 10, 7, 18, 1, 1, 6, 4, 5, 15, 11, 13, 9, 16, 11, 13, 8, 22]