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.

A175046 Write n in binary, then increase each run of 0's by one 0, and increase each run of 1's by one 1. a(n) is the decimal equivalent of the result.

Table of values

n a(n)
1 3
2 12
3 7
4 24
5 51
6 28
7 15
8 48
9 99
10 204
11 103
12 56
13 115
14 60
15 31
16 96
17 195
18 396
19 199
20 408
21 819
22 412
23 207
24 112
25 227
26 460
27 231
28 120
29 243
30 124
31 63
32 192
33 387
34 780
35 391
36 792
37 1587
38 796
39 399
40 816
41 1635
42 3276
43 1639
44 824
45 1651
46 828
47 415
48 224
49 451
50 908
51 455
52 920
53 1843
54 924

List of values

[3, 12, 7, 24, 51, 28, 15, 48, 99, 204, 103, 56, 115, 60, 31, 96, 195, 396, 199, 408, 819, 412, 207, 112, 227, 460, 231, 120, 243, 124, 63, 192, 387, 780, 391, 792, 1587, 796, 399, 816, 1635, 3276, 1639, 824, 1651, 828, 415, 224, 451, 908, 455, 920, 1843, 924]