A269168 - cp's OEIS frontend

A269168 Rule 30 binary tree permutation: a(1) = 1, a(2n) = A269160(a(n)), a(2n+1) = A269164(1+a(n)).

n	a(n)
1	1
2	7
3	2
4	25
5	9
6	14
7	3
8	111
9	33
10	63
11	11
12	50
13	18
14	13
15	4
16	401
17	143
18	231
19	41
20	193
21	79
22	53
23	15
24	222
25	66
26	126
27	22
28	51
29	17
30	28
31	5
32	1783
33	529
34	945
35	175
36	825
37	295
38	223
39	55
40	839
41	257
42	497
43	95
44	203
45	69
46	49
47	19
48	802
49	286
50	462
51	82
52	386
53	158
54	106
55	30
56	221
57	67
58	119
59	21
60	100
61	36
62	27
63	6
64	6409
65	2295
66	3703
67	657
68	3159
69	1201
70	849
71	233

[1, 7, 2, 25, 9, 14, 3, 111, 33, 63, 11, 50, 18, 13, 4, 401, 143, 231, 41, 193, 79, 53, 15, 222, 66, 126, 22, 51, 17, 28, 5, 1783, 529, 945, 175, 825, 295, 223, 55, 839, 257, 497, 95, 203, 69, 49, 19, 802, 286, 462, 82, 386, 158, 106, 30, 221, 67, 119, 21, 100, 36, 27, 6, 6409, 2295, 3703, 657, 3159, 1201, 849, 233]

cp's OEIS Frontend

A269168 Rule 30 binary tree permutation: a(1) = 1, a(2n) = A269160(a(n)), a(2n+1) = A269164(1+a(n)).

Table of values

List of values