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.

A088512 Number of partitions of n into two parts whose xor-sum is n.

Table of values

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

List of values

[0, 0, 0, 1, 0, 1, 1, 3, 0, 1, 1, 3, 1, 3, 3, 7, 0, 1, 1, 3, 1, 3, 3, 7, 1, 3, 3, 7, 3, 7, 7, 15, 0, 1, 1, 3, 1, 3, 3, 7, 1, 3, 3, 7, 3, 7, 7, 15, 1, 3, 3, 7, 3, 7, 7, 15, 3, 7, 7, 15, 7, 15, 15, 31, 0, 1, 1, 3, 1, 3, 3, 7, 1, 3, 3, 7, 3, 7, 7, 15, 1, 3, 3, 7]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.