A123015 - cp's OEIS frontend

A123015 Grow a binary tree using the following rules. Initially there is a single node labeled 1. At each step we add 1 to all labels less than 3. If a node has label 3 and zero or one descendants we add a new descendant labeled 1. Sequence gives sum of all labels at step n.

n	a(n)
0	1
1	2
2	3
3	4
4	6
5	8
6	10
7	13
8	17
9	21
10	26
11	33
12	41
13	50
14	62
15	77
16	94
17	115
18	142
19	174
20	212
21	260
22	319
23	389
24	475
25	582
26	711
27	867
28	1060
29	1296
30	1581
31	1930
32	2359
33	2880
34	3514
35	4292
36	5242
37	6397
38	7809
39	9537
40	11642
41	14209
42	17349
43	21182
44	25854
45	31561
46	38534
47	47039
48	57418
49	70098
50	85576

[1, 2, 3, 4, 6, 8, 10, 13, 17, 21, 26, 33, 41, 50, 62, 77, 94, 115, 142, 174, 212, 260, 319, 389, 475, 582, 711, 867, 1060, 1296, 1581, 1930, 2359, 2880, 3514, 4292, 5242, 6397, 7809, 9537, 11642, 14209, 17349, 21182, 25854, 31561, 38534, 47039, 57418, 70098, 85576]

cp's OEIS Frontend

A123015 Grow a binary tree using the following rules. Initially there is a single node labeled 1. At each step we add 1 to all labels less than 3. If a node has label 3 and zero or one descendants we add a new descendant labeled 1. Sequence gives sum of all labels at step n.

Table of values

List of values