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.

A048724 Write n and 2n in binary and add them mod 2.

Table of values

n a(n)
0 0
1 3
2 6
3 5
4 12
5 15
6 10
7 9
8 24
9 27
10 30
11 29
12 20
13 23
14 18
15 17
16 48
17 51
18 54
19 53
20 60
21 63
22 58
23 57
24 40
25 43
26 46
27 45
28 36
29 39
30 34
31 33
32 96
33 99
34 102
35 101
36 108
37 111
38 106
39 105
40 120
41 123
42 126
43 125
44 116
45 119
46 114
47 113
48 80
49 83
50 86
51 85
52 92
53 95
54 90
55 89
56 72
57 75
58 78
59 77
60 68
61 71
62 66
63 65
64 192

List of values

[0, 3, 6, 5, 12, 15, 10, 9, 24, 27, 30, 29, 20, 23, 18, 17, 48, 51, 54, 53, 60, 63, 58, 57, 40, 43, 46, 45, 36, 39, 34, 33, 96, 99, 102, 101, 108, 111, 106, 105, 120, 123, 126, 125, 116, 119, 114, 113, 80, 83, 86, 85, 92, 95, 90, 89, 72, 75, 78, 77, 68, 71, 66, 65, 192]

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

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