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.

A166166 Write n in binary with each run (of either digit b) of the k-th longest distinct run-length replaced with a run of digit b of a length equal to that of the k-th shortest distinct run-length. Convert back to decimal for a(n). (See comment.)

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 6
5 5
6 4
7 7
8 14
9 27
10 10
11 25
12 12
13 19
14 8
15 15
16 30
17 119
18 108
19 13
20 102
21 21
22 100
23 113
24 28
25 11
26 76
27 9
28 24
29 71
30 16
31 31
32 62
33 495
34 952
35 59
36 54
37 435
38 52
39 57
40 910
41 411
42 42
43 409
44 50
45 403
46 904
47 481
48 60
49 55
50 44
51 51
52 38
53 307
54 36
55 49
56 56
57 39
58 568
59 35
60 48
61 271
62 32
63 63
64 126

List of values

[0, 1, 2, 3, 6, 5, 4, 7, 14, 27, 10, 25, 12, 19, 8, 15, 30, 119, 108, 13, 102, 21, 100, 113, 28, 11, 76, 9, 24, 71, 16, 31, 62, 495, 952, 59, 54, 435, 52, 57, 910, 411, 42, 409, 50, 403, 904, 481, 60, 55, 44, 51, 38, 307, 36, 49, 56, 39, 568, 35, 48, 271, 32, 63, 126]