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.

A268833 Square array A(n, k) = A101080(k, A003188(n+A006068(k))), read by descending antidiagonals, where A003188 is the binary Gray code, A006068 is its inverse, and A101080(x,y) gives the Hamming distance between binary expansions of x and y.

Table of values

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

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 2, 1, 0, 1, 2, 3, 2, 0, 1, 2, 3, 2, 3, 0, 1, 2, 1, 2, 1, 2, 0, 1, 2, 3, 2, 3, 2, 1, 0, 1, 2, 1, 2, 3, 4, 3, 2, 0, 1, 2, 1, 2, 3, 4, 3, 2, 3, 0, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 0, 1, 2, 3, 2, 3, 4, 3, 2, 1, 4, 3, 0, 1, 2, 1, 2, 1, 2, 3, 2, 3, 2, 3, 2, 0, 1, 2, 1, 2, 3, 2, 1, 2, 3, 2, 3, 2, 3, 0, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 1, 2, 1, 2]