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.

A057336 1) Write n in binary; 2) Find run lengths of this expression; 3) Replace these as follows: 1 -> 0, 2 -> 010, 3 -> 01010, 4 -> 0101010...; 4) Remove final 0 and append an initial 1; 5) The term a(n) is the number with the obtained Zeckendorf expression.

Table of values

n a(n)
1 1
2 2
3 4
4 6
5 3
6 7
7 12
8 17
9 10
10 5
11 9
12 19
13 11
14 20
15 33
16 46
17 28
18 16
19 27
20 14
21 8
22 15
23 25
24 51
25 31
26 18
27 30
28 53
29 32
30 54
31 88
32 122
33 75
34 45
35 74
36 43
37 26
38 44
39 72
40 38
41 23
42 13
43 22
44 40
45 24
46 41
47 67
48 135
49 83
50 50
51 82
52 48
53 29
54 49
55 80
56 140
57 86
58 52
59 85
60 142
61 87
62 143
63 232
64 321
65 198
66 121
67 197
68 119

List of values

[1, 2, 4, 6, 3, 7, 12, 17, 10, 5, 9, 19, 11, 20, 33, 46, 28, 16, 27, 14, 8, 15, 25, 51, 31, 18, 30, 53, 32, 54, 88, 122, 75, 45, 74, 43, 26, 44, 72, 38, 23, 13, 22, 40, 24, 41, 67, 135, 83, 50, 82, 48, 29, 49, 80, 140, 86, 52, 85, 142, 87, 143, 232, 321, 198, 121, 197, 119]