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.

A341335 For any number n with binary expansion (b_1, ..., b_k), the binary expansion of a(n), say (c_1, ..., c_k) satisfies c_m = Sum_{d | m} b_d mod 2 for m = 1..k.

Table of values

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

List of values

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