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.

A067585 Binary representation of a(n) is obtained thus: replace every digit in the binary representation of n with "1" if the sum of its neighbors is 1 and with "0" otherwise.

Table of values

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

List of values

[0, 0, 1, 3, 2, 0, 7, 5, 4, 6, 1, 3, 14, 12, 11, 9, 8, 10, 13, 15, 2, 0, 7, 5, 28, 30, 25, 27, 22, 20, 19, 17, 16, 18, 21, 23, 26, 24, 31, 29, 4, 6, 1, 3, 14, 12, 11, 9, 56, 58, 61, 63, 50, 48, 55, 53, 44, 46, 41, 43, 38, 36, 35, 33, 32, 34, 37, 39, 42, 40, 47, 45, 52, 54, 49, 51, 62]