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.

A153243 Positions of balanced binary trees in A014486, i.e., trees where number of vertices in the right subtree = number of vertices in the left subtree.

Table of values

n a(n)
0 0
1 1
2 6
3 42
4 43
5 51
6 52
7 385
8 386
9 387
10 388
11 389
12 413
13 414
14 415
15 416
16 417
17 475
18 476
19 477
20 478
21 479
22 503
23 504
24 505
25 506
26 507
27 551
28 552
29 553
30 554
31 555
32 4089
33 4090
34 4091
35 4092
36 4093
37 4094
38 4095
39 4096
40 4097
41 4098
42 4099
43 4100
44 4101
45 4102
46 4179
47 4180

List of values

[0, 1, 6, 42, 43, 51, 52, 385, 386, 387, 388, 389, 413, 414, 415, 416, 417, 475, 476, 477, 478, 479, 503, 504, 505, 506, 507, 551, 552, 553, 554, 555, 4089, 4090, 4091, 4092, 4093, 4094, 4095, 4096, 4097, 4098, 4099, 4100, 4101, 4102, 4179, 4180]