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.

A162853 Take the binary representation of n. Reduce by one digit every run (completely of either 0's or 1's) of an even number of digits. Increase by one digit every run of an odd number of digits in the binary representation of n (where this added digit has the same value that makes up the rest of the run's digits). a(n) = the decimal equivalent of the result.

Table of values

n a(n)
0 0
1 3
2 12
3 1
4 6
5 51
6 4
7 15
8 48
9 27
10 204
11 25
12 2
13 19
14 60
15 7
16 24
17 195
18 108
19 13
20 102
21 819
22 100
23 207
24 16
25 11
26 76
27 9
28 30
29 243
30 28
31 63
32 192
33 99
34 780
35 97
36 54
37 435
38 52
39 111
40 816
41 411
42 3276
43 409
44 50
45 403
46 828
47 103
48 8
49 67
50 44
51 5
52 38
53 307
54 36
55 79
56 240
57 123
58 972
59 121
60 14
61 115
62 252
63 31
64 96

List of values

[0, 3, 12, 1, 6, 51, 4, 15, 48, 27, 204, 25, 2, 19, 60, 7, 24, 195, 108, 13, 102, 819, 100, 207, 16, 11, 76, 9, 30, 243, 28, 63, 192, 99, 780, 97, 54, 435, 52, 111, 816, 411, 3276, 409, 50, 403, 828, 103, 8, 67, 44, 5, 38, 307, 36, 79, 240, 123, 972, 121, 14, 115, 252, 31, 96]