A071162 - cp's OEIS frontend

A071162 Simple rewriting of binary expansion of n resulting A014486-codes 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).

n	a(n)
0	0
1	2
2	10
3	12
4	42
5	44
6	52
7	56
8	170
9	172
10	180
11	184
12	212
13	216
14	232
15	240
16	682
17	684
18	692
19	696
20	724
21	728
22	744
23	752
24	852
25	856
26	872
27	880
28	936
29	944
30	976
31	992
32	2730
33	2732
34	2740
35	2744
36	2772
37	2776
38	2792
39	2800
40	2900
41	2904
42	2920
43	2928
44	2984
45	2992
46	3024
47	3040
48	3412
49	3416

[0, 2, 10, 12, 42, 44, 52, 56, 170, 172, 180, 184, 212, 216, 232, 240, 682, 684, 692, 696, 724, 728, 744, 752, 852, 856, 872, 880, 936, 944, 976, 992, 2730, 2732, 2740, 2744, 2772, 2776, 2792, 2800, 2900, 2904, 2920, 2928, 2984, 2992, 3024, 3040, 3412, 3416]

cp's OEIS Frontend

A071162 Simple rewriting of binary expansion of n resulting A014486-codes 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

List of values