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.

A038776 The sequence a[1] to a[ cat[n] ] is the permutation that converts forest[n] of depth-first planar planted binary trees into breadth-first representation.

Table of values

n a(n)
1 1
2 2
3 4
4 5
5 3
6 9
7 10
8 13
9 14
10 12
11 6
12 7
13 8
14 11
15 23
16 24
17 27
18 28
19 26
20 36
21 37
22 41
23 42
24 40
25 32
26 33
27 35
28 39
29 15
30 16
31 18
32 19
33 17
34 22
35 25
36 20
37 21
38 34
39 38
40 29
41 30
42 31
43 65
44 66
45 69
46 70
47 68
48 78
49 79
50 83
51 84
52 82
53 74
54 75
55 77
56 81
57 106
58 107
59 111
60 112
61 110
62 125
63 126
64 131
65 132
66 130

List of values

[1, 2, 4, 5, 3, 9, 10, 13, 14, 12, 6, 7, 8, 11, 23, 24, 27, 28, 26, 36, 37, 41, 42, 40, 32, 33, 35, 39, 15, 16, 18, 19, 17, 22, 25, 20, 21, 34, 38, 29, 30, 31, 65, 66, 69, 70, 68, 78, 79, 83, 84, 82, 74, 75, 77, 81, 106, 107, 111, 112, 110, 125, 126, 131, 132, 130]