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.

A243589 Numbers returned when each binary digit of n is replaced by the sum modulo 2 of the digits to its (wrapped) left and (wrapped) right.

Table of values

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

List of values

[0, 0, 0, 3, 5, 6, 0, 5, 15, 0, 10, 15, 5, 10, 0, 9, 27, 12, 30, 3, 17, 6, 20, 29, 15, 24, 10, 23, 5, 18, 0, 17, 51, 20, 54, 27, 57, 30, 60, 5, 39, 0, 34, 15, 45, 10, 40, 57, 27, 60, 30, 51, 17, 54, 20, 45, 15, 40, 10, 39, 5, 34, 0, 33, 99, 36, 102, 43, 105, 46]

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

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