A054089 - cp's OEIS frontend

A054089 For k >= 1, let p(k) = least h in N not already an a(i), q(k) = p(k)+k, a(2k) = q(k), a(2k+1) = p(k).

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

[1, 3, 2, 6, 4, 8, 5, 11, 7, 14, 9, 16, 10, 19, 12, 21, 13, 24, 15, 27, 17, 29, 18, 32, 20, 35, 22, 37, 23, 40, 25, 42, 26, 45, 28, 48, 30, 50, 31, 53, 33, 55, 34, 58, 36, 61, 38, 63, 39, 66, 41, 69, 43, 71, 44, 74, 46, 76, 47, 79, 49, 82, 51]

cp's OEIS Frontend

A054089 For k >= 1, let p(k) = least h in N not already an a(i), q(k) = p(k)+k, a(2k) = q(k), a(2k+1) = p(k).

Table of values

List of values

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

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

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