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.

A050314 Triangle: a(n,k) = number of partitions of n whose xor-sum is k.

Table of values

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

List of values

[1, 0, 1, 1, 0, 1, 0, 1, 0, 2, 2, 0, 2, 0, 1, 0, 3, 0, 2, 0, 2, 4, 0, 3, 0, 2, 0, 2, 0, 4, 0, 4, 0, 2, 0, 5, 6, 0, 5, 0, 4, 0, 6, 0, 1, 0, 8, 0, 6, 0, 8, 0, 6, 0, 2, 10, 0, 9, 0, 11, 0, 8, 0, 2, 0, 2, 0, 11, 0, 14, 0, 12, 0, 12, 0, 2, 0, 5, 16, 0, 18, 0, 15, 0, 16, 0, 4, 0, 6, 0, 2, 0, 23, 0, 20, 0, 20, 0, 19, 0, 8, 0, 6, 0, 5]