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.

A116683 Triangle read by rows: T(n,k) is the number of partitions of n into distinct parts, in which the sum of the even parts is k (n>=0, 0<=k<=n).

Table of values

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

List of values

[1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 2, 1, 0, 1, 0, 1, 0, 2, 2, 0, 1, 0, 1, 0, 0, 0, 2, 2, 0, 1, 0, 1, 0, 2, 0, 2, 2, 0, 2, 0, 1, 0, 2, 0, 0, 0, 3, 2, 0, 2, 0, 1, 0, 2, 0, 2, 0, 3, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 0, 0, 4, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 3, 0, 4, 3, 0, 3, 0, 2, 0, 4]