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.

A048833 Number of starting positions of Nim with 2n pieces such that 2nd player wins. Partitions of 2n such that xor-sum of partitions is 0.

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 6
5 10
6 16
7 31
8 43
9 68
10 98
11 153
12 213
13 317
14 443
15 704
16 971
17 1415
18 1975
19 2818
20 3865
21 5401
22 7366
23 10142
24 13639
25 18438
26 24583
27 32861
28 43345
29 57268
30 75175
31 99119
32 129278
33 168796
34 219614
35 284887
36 368546
37 475919
38 614379
39 788845
40 1012117
41 1293980
42 1654090

List of values

[1, 1, 2, 4, 6, 10, 16, 31, 43, 68, 98, 153, 213, 317, 443, 704, 971, 1415, 1975, 2818, 3865, 5401, 7366, 10142, 13639, 18438, 24583, 32861, 43345, 57268, 75175, 99119, 129278, 168796, 219614, 284887, 368546, 475919, 614379, 788845, 1012117, 1293980, 1654090]