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.

A257676 Permutation of nonnegative integers obtained by traversing the tendrils (finite side-trees) of the binary beanstalk in depth-first order, with also each number in the infinite trunk visited, but only after its sister branch has been traversed first.

Table of values

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

List of values

[0, 1, 2, 3, 5, 4, 6, 7, 9, 8, 10, 12, 13, 11, 14, 15, 17, 16, 18, 20, 21, 19, 22, 24, 25, 28, 29, 23, 27, 26, 30, 31, 33, 32, 34, 36, 37, 35, 38, 40, 41, 44, 45, 39, 43, 42, 47, 50, 54, 58, 59, 55, 51, 46, 48, 49, 52, 53, 56, 60, 61, 57, 62, 63, 65, 64, 66, 68, 69, 67, 70, 72, 73, 76, 77, 71, 75, 74, 79, 82, 86, 90, 91, 87, 83, 78, 80, 81]