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.

A279521 Maximum number of single-direction edges in leveled binary trees with n nodes.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 3
6 3
7 3
8 4
9 5
10 6
11 7
12 7
13 7
14 7
15 7
16 8
17 9
18 10
19 11
20 12
21 13
22 14
23 15
24 15
25 15
26 15
27 15
28 15
29 15
30 15
31 15
32 16
33 17
34 18
35 19
36 20
37 21
38 22
39 23
40 24
41 25
42 26
43 27
44 28
45 29
46 30
47 31
48 31
49 31
50 31
51 31
52 31
53 31
54 31
55 31
56 31
57 31
58 31
59 31
60 31
61 31
62 31
63 31
64 32
65 33
66 34
67 35
68 36
69 37
70 38

List of values

[0, 1, 1, 2, 3, 3, 3, 4, 5, 6, 7, 7, 7, 7, 7, 8, 9, 10, 11, 12, 13, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 32, 33, 34, 35, 36, 37, 38]

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

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