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.

A026921 Triangular array E by rows: E(n,k) = number of partitions of n into an even number of parts, the greatest being k.

Table of values

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

List of values

[0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 0, 0, 2, 1, 2, 1, 1, 0, 1, 2, 3, 2, 2, 1, 1, 0, 0, 2, 3, 3, 2, 2, 1, 1, 0, 1, 2, 5, 4, 4, 2, 2, 1, 1, 0, 0, 3, 4, 6, 4, 4, 2, 2, 1, 1, 0, 1, 3, 7, 7, 7, 5, 4, 2, 2, 1, 1, 0, 0, 3, 6, 10, 8, 7, 5, 4, 2, 2, 1, 1, 0, 1, 3, 9, 11, 13, 9, 8, 5, 4, 2, 2, 1, 1, 0]