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.

A193494 Worst case of an unbalanced recursive algorithm over all n-node binary trees.

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 5
5 7
6 9
7 13
8 14
9 16
10 18
11 22
12 24
13 28
14 32
15 40
16 41
17 43
18 45
19 49
20 51
21 55
22 59
23 67
24 69
25 73
26 77
27 85
28 89
29 97
30 105
31 121
32 122
33 124
34 126
35 130
36 132
37 136
38 140
39 148
40 150
41 154
42 158
43 166
44 170
45 178
46 186
47 202
48 204
49 208
50 212
51 220
52 224
53 232
54 240
55 256
56 260
57 268
58 276
59 292
60 300

List of values

[0, 1, 2, 4, 5, 7, 9, 13, 14, 16, 18, 22, 24, 28, 32, 40, 41, 43, 45, 49, 51, 55, 59, 67, 69, 73, 77, 85, 89, 97, 105, 121, 122, 124, 126, 130, 132, 136, 140, 148, 150, 154, 158, 166, 170, 178, 186, 202, 204, 208, 212, 220, 224, 232, 240, 256, 260, 268, 276, 292, 300]

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

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