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.

A116598 Triangle read by rows: T(n,k) is the number of partitions of n having exactly k parts equal to 1 (n>=0, 0<=k<=n).

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 2, 1, 1, 0, 1, 4, 2, 2, 1, 1, 0, 1, 4, 4, 2, 2, 1, 1, 0, 1, 7, 4, 4, 2, 2, 1, 1, 0, 1, 8, 7, 4, 4, 2, 2, 1, 1, 0, 1, 12, 8, 7, 4, 4, 2, 2, 1, 1, 0, 1, 14, 12, 8, 7, 4, 4, 2, 2, 1, 1, 0, 1, 21, 14, 12, 8, 7, 4, 4, 2, 2, 1, 1, 0, 1, 24, 21, 14, 12, 8, 7, 4, 4, 2, 2, 1, 1, 0, 1]