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.

A057337 1) Write the Zeckendorf expression of n; 2) Remove initial 1 and append a final 0; 3) Replace numbers in this as follows: 0 -> 1, 010 -> 2, 01010 -> 3, 0101010 -> 4...; 4) Find a binary number with run lengths from step 3 (starting with 1); 5) The term a(n) is the decimal equivalent of this binary number.

Table of values

n a(n)
1 1
2 2
3 5
4 3
5 10
6 4
7 6
8 21
9 11
10 9
11 13
12 7
13 42
14 20
15 22
16 18
17 8
18 26
19 12
20 14
21 85
22 43
23 41
24 45
25 23
26 37
27 19
28 17
29 53
30 27
31 25
32 29
33 15
34 170
35 84
36 86
37 82
38 40
39 90
40 44
41 46
42 74
43 36
44 38
45 34
46 16
47 106
48 52
49 54
50 50
51 24
52 58
53 28
54 30
55 341
56 171
57 169
58 173
59 87
60 165
61 83
62 81
63 181
64 91
65 89
66 93
67 47
68 149
69 75

List of values

[1, 2, 5, 3, 10, 4, 6, 21, 11, 9, 13, 7, 42, 20, 22, 18, 8, 26, 12, 14, 85, 43, 41, 45, 23, 37, 19, 17, 53, 27, 25, 29, 15, 170, 84, 86, 82, 40, 90, 44, 46, 74, 36, 38, 34, 16, 106, 52, 54, 50, 24, 58, 28, 30, 341, 171, 169, 173, 87, 165, 83, 81, 181, 91, 89, 93, 47, 149, 75]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.