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.

A071163 A014486-indices for rooted binary trees with height equal to number of internal vertices. (Binary trees where at each internal vertex at least the other child is leaf.)

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 4
5 5
6 7
7 8
8 9
9 10
10 12
11 13
12 17
13 18
14 21
15 22
16 23
17 24
18 26
19 27
20 31
21 32
22 35
23 36
24 45
25 46
26 49
27 50
28 58
29 59
30 63
31 64
32 65
33 66
34 68
35 69
36 73
37 74
38 77
39 78
40 87
41 88
42 91
43 92
44 100
45 101
46 105
47 106
48 129
49 130
50 133
51 134
52 142
53 143
54 147
55 148
56 170
57 171
58 175
59 176
60 189
61 190
62 195
63 196
64 197

List of values

[0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 12, 13, 17, 18, 21, 22, 23, 24, 26, 27, 31, 32, 35, 36, 45, 46, 49, 50, 58, 59, 63, 64, 65, 66, 68, 69, 73, 74, 77, 78, 87, 88, 91, 92, 100, 101, 105, 106, 129, 130, 133, 134, 142, 143, 147, 148, 170, 171, 175, 176, 189, 190, 195, 196, 197]