A339723 - cp's OEIS frontend

A339723 Start with a(1)=1. Thereafter, to get a(n), write a(n-1) in binary, write down all its run lengths, and concatenate them in binary, getting k. Then a(n) = k unless k is already in the sequence, in which case a(n) = smallest missing number.

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

[1, 2, 3, 4, 6, 5, 7, 8, 9, 13, 11, 14, 10, 15, 12, 16, 17, 18, 27, 22, 29, 19, 26, 23, 20, 30, 21, 31, 24, 25, 28, 32, 33, 34, 35, 36, 54, 45, 59, 37, 55, 38, 53, 47, 39, 40, 41, 61, 42, 63, 43, 62, 44, 58, 46, 48, 49, 50, 51, 52, 56, 57, 60, 64, 65, 66, 67, 68, 69]

cp's OEIS Frontend

A339723 Start with a(1)=1. Thereafter, to get a(n), write a(n-1) in binary, write down all its run lengths, and concatenate them in binary, getting k. Then a(n) = k unless k is already in the sequence, in which case a(n) = smallest missing number.

Table of values

List of values

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

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

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