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.

A303767 May code of n: a(0) = 0, and for n > 0, if n = 2^k, a(n) = n + a(n-1), otherwise, when n = 2^k + r (with 0 < r < 2^k), then a(n) = 2^k + a(r-1); see comments for equivalent alternative descriptions.

Table of values

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

List of values

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