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.

A240009 Number T(n,k) of partitions of n, where k is the difference between the number of odd parts and the number of even parts; triangle T(n,k), n>=0, -floor(n/2)+(n mod 2)<=k<=n, read by rows.

Table of values

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

List of values

[1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 2, 1, 1, 1, 0, 1, 1, 1, 1, 1, 2, 2, 1, 1, 0, 1, 1, 2, 3, 2, 2, 2, 1, 1, 0, 1, 1, 1, 2, 2, 2, 4, 3, 2, 2, 1, 1, 0, 1, 1, 2, 4, 5, 3, 4, 4, 2, 2, 1, 1, 0, 1, 1, 1, 2, 3, 3, 5, 7, 5, 4, 4, 2, 2, 1, 1, 0, 1, 1, 2, 4, 7, 7, 6, 8, 6, 4, 4, 2, 2, 1, 1, 0, 1]