A233559 - cp's OEIS frontend

A233559 Tree read by levels generated by these rules: 1 is at the top, and the node x has child nodes x+1, 2x, and 3x, where duplicates are deleted as they occur.

n	a(n)
1	1
2	2
3	3
4	4
5	6
6	9
7	5
8	8
9	12
10	7
11	18
12	10
13	27
14	15
15	16
16	24
17	13
18	36
19	14
20	21
21	19
22	54
23	11
24	20
25	30
26	28
27	81
28	45
29	17
30	32
31	48
32	25
33	72
34	26
35	39
36	37
37	108
38	42
39	22
40	63
41	38
42	57
43	55
44	162
45	33
46	40
47	60
48	31
49	90
50	29
51	56
52	84
53	82
54	243
55	46
56	135
57	34
58	51
59	64
60	96
61	49
62	144
63	50
64	75
65	73

[1, 2, 3, 4, 6, 9, 5, 8, 12, 7, 18, 10, 27, 15, 16, 24, 13, 36, 14, 21, 19, 54, 11, 20, 30, 28, 81, 45, 17, 32, 48, 25, 72, 26, 39, 37, 108, 42, 22, 63, 38, 57, 55, 162, 33, 40, 60, 31, 90, 29, 56, 84, 82, 243, 46, 135, 34, 51, 64, 96, 49, 144, 50, 75, 73]

cp's OEIS Frontend

A233559 Tree read by levels generated by these rules: 1 is at the top, and the node x has child nodes x+1, 2x, and 3x, where duplicates are deleted as they occur.

Table of values

List of values

n	a(n)
1	1
2	2
3	3
4	4
5	6
6	9
7	5
8	8
9	12
10	7
11	18
12	10
13	27
14	15
15	16
16	24
17	13
18	36
19	14
20	21
21	19
22	54
23	11
24	20
25	30
26	28
27	81
28	45
29	17
30	32
31	48
32	25
33	72
34	26
35	39
36	37
37	108
38	42
39	22
40	63
41	38
42	57
43	55
44	162
45	33
46	40
47	60
48	31
49	90
50	29
51	56
52	84
53	82
54	243
55	46
56	135
57	34
58	51
59	64
60	96
61	49
62	144
63	50
64	75
65	73

n	a(n)
1	1
2	2
3	3
4	4
5	6
6	9
7	5
8	8
9	12
10	7
11	18
12	10
13	27
14	15
15	16
16	24
17	13
18	36
19	14
20	21
21	19
22	54
23	11
24	20
25	30
26	28
27	81
28	45
29	17
30	32
31	48
32	25
33	72
34	26
35	39
36	37
37	108
38	42
39	22
40	63
41	38
42	57
43	55
44	162
45	33
46	40
47	60
48	31
49	90
50	29
51	56
52	84
53	82
54	243
55	46
56	135
57	34
58	51
59	64
60	96
61	49
62	144
63	50
64	75
65	73

cp's OEIS Frontend

A233559 Tree read by levels generated by these rules: 1 is at the top, and the node x has child nodes x+1, 2*x, and 3*x, where duplicates are deleted as they occur.

Table of values

List of values

A233559 Tree read by levels generated by these rules: 1 is at the top, and the node x has child nodes x+1, 2x, and 3x, where duplicates are deleted as they occur.

n	a(n)
1	1
2	2
3	3
4	4
5	6
6	9
7	5
8	8
9	12
10	7
11	18
12	10
13	27
14	15
15	16
16	24
17	13
18	36
19	14
20	21
21	19
22	54
23	11
24	20
25	30
26	28
27	81
28	45
29	17
30	32
31	48
32	25
33	72
34	26
35	39
36	37
37	108
38	42
39	22
40	63
41	38
42	57
43	55
44	162
45	33
46	40
47	60
48	31
49	90
50	29
51	56
52	84
53	82
54	243
55	46
56	135
57	34
58	51
59	64
60	96
61	49
62	144
63	50
64	75
65	73