A304971 - cp's OEIS frontend

A304971 a(1) = 0, and for any n > 0, a(2n) = a(n) + k(n) and a(2n+1) = a(n) + 3 * k(n) where k(n) is the least positive integer not leading to a duplicate term in the sequence.

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

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

cp's OEIS Frontend

A304971 a(1) = 0, and for any n > 0, a(2n) = a(n) + k(n) and a(2n+1) = a(n) + 3 * k(n) where k(n) is the least positive integer not leading to a duplicate term in the sequence.

Table of values

List of values

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

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

cp's OEIS Frontend

A304971 a(1) = 0, and for any n > 0, a(2*n) = a(n) + k(n) and a(2*n+1) = a(n) + 3 * k(n) where k(n) is the least positive integer not leading to a duplicate term in the sequence.

Table of values

List of values

A304971 a(1) = 0, and for any n > 0, a(2n) = a(n) + k(n) and a(2n+1) = a(n) + 3 * k(n) where k(n) is the least positive integer not leading to a duplicate term in the sequence.

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