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.

A131218 Array read by antidiagonals: A(n, k) = 1 if and only if the Gray codes for n and k have no bits in common.

Table of values

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

List of values

[1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1]