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.

A227408 Set of all n, where n = r(s(n)) = s(r(n)), given that r(n) = n+bitcount(n), s(n) = n-bitcount(n), and bitcount(n) is the count of binary 1's in n.

Table of values

n a(n)
1 0
2 22
3 25
4 38
5 41
6 70
7 73
8 134
9 137
10 237
11 243
12 262
13 265
14 365
15 371
16 429
17 435
18 461
19 467
20 492
21 494
22 498
23 501
24 518
25 521
26 621
27 627
28 685
29 691
30 717
31 723
32 748
33 750
34 754
35 757
36 813
37 819
38 845
39 851
40 876
41 878
42 882
43 885
44 909
45 915
46 940
47 942
48 946
49 949
50 972
51 974
52 978
53 981
54 988
55 995
56 1002
57 1009
58 1030
59 1033
60 1133
61 1139
62 1197
63 1203
64 1229

List of values

[0, 22, 25, 38, 41, 70, 73, 134, 137, 237, 243, 262, 265, 365, 371, 429, 435, 461, 467, 492, 494, 498, 501, 518, 521, 621, 627, 685, 691, 717, 723, 748, 750, 754, 757, 813, 819, 845, 851, 876, 878, 882, 885, 909, 915, 940, 942, 946, 949, 972, 974, 978, 981, 988, 995, 1002, 1009, 1030, 1033, 1133, 1139, 1197, 1203, 1229]