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.

A340312 Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 0
5 1
6 1
7 0
8 1
9 1
10 1
11 1
12 0
13 7
14 14
15 7
16 0
17 1
18 1
19 1
20 1
21 0
22 35
23 140
24 273
25 448
26 715
27 870
28 715
29 448
30 273
31 140
32 35
33 0
34 1
35 1
36 1
37 1
38 0
39 155
40 1240
41 6293
42 27776
43 105183
44 330460
45 876525
46 2011776
47 4032015
48 7063784
49 10855425
50 14721280
51 17678835
52 18796230
53 17678835
54 14721280
55 10855425
56 7063784
57 4032015
58 2011776
59 876525
60 330460
61 105183
62 27776
63 6293
64 1240
65 155
66 0
67 1
68 1

List of values

[1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 7, 14, 7, 0, 1, 1, 1, 1, 0, 35, 140, 273, 448, 715, 870, 715, 448, 273, 140, 35, 0, 1, 1, 1, 1, 0, 155, 1240, 6293, 27776, 105183, 330460, 876525, 2011776, 4032015, 7063784, 10855425, 14721280, 17678835, 18796230, 17678835, 14721280, 10855425, 7063784, 4032015, 2011776, 876525, 330460, 105183, 27776, 6293, 1240, 155, 0, 1, 1]