A261728 - cp's OEIS frontend

A261728 a(1)=1; a(2n) = 3n; for odd n>1, a(n) is the smallest number not already present which is entailed by the rules (i) k present => 3k+1 present; (ii) 2k present => k present.

n	a(n)
1	1
2	3
3	4
4	6
5	2
6	9
7	7
8	12
9	10
10	15
11	5
12	18
13	13
14	21
15	16
16	24
17	8
18	27
19	19
20	30
21	22
22	33
23	11
24	36
25	25
26	39
27	28
28	42
29	14
30	45
31	31
32	48
33	34
34	51
35	17
36	54
37	37
38	57
39	40
40	60
41	20
42	63
43	43
44	66
45	46
46	69
47	23
48	72
49	49
50	75
51	52
52	78
53	26
54	81
55	55
56	84
57	58
58	87
59	29
60	90
61	61
62	93
63	64
64	96
65	32
66	99
67	67
68	102
69	70
70	105
71	35
72	108
73	73
74	111
75	76
76	114
77	38
78	117
79	79

[1, 3, 4, 6, 2, 9, 7, 12, 10, 15, 5, 18, 13, 21, 16, 24, 8, 27, 19, 30, 22, 33, 11, 36, 25, 39, 28, 42, 14, 45, 31, 48, 34, 51, 17, 54, 37, 57, 40, 60, 20, 63, 43, 66, 46, 69, 23, 72, 49, 75, 52, 78, 26, 81, 55, 84, 58, 87, 29, 90, 61, 93, 64, 96, 32, 99, 67, 102, 70, 105, 35, 108, 73, 111, 76, 114, 38, 117, 79]

cp's OEIS Frontend

A261728 a(1)=1; a(2n) = 3n; for odd n>1, a(n) is the smallest number not already present which is entailed by the rules (i) k present => 3k+1 present; (ii) 2k present => k present.

Table of values

List of values

n	a(n)
1	1
2	3
3	4
4	6
5	2
6	9
7	7
8	12
9	10
10	15
11	5
12	18
13	13
14	21
15	16
16	24
17	8
18	27
19	19
20	30
21	22
22	33
23	11
24	36
25	25
26	39
27	28
28	42
29	14
30	45
31	31
32	48
33	34
34	51
35	17
36	54
37	37
38	57
39	40
40	60
41	20
42	63
43	43
44	66
45	46
46	69
47	23
48	72
49	49
50	75
51	52
52	78
53	26
54	81
55	55
56	84
57	58
58	87
59	29
60	90
61	61
62	93
63	64
64	96
65	32
66	99
67	67
68	102
69	70
70	105
71	35
72	108
73	73
74	111
75	76
76	114
77	38
78	117
79	79

n	a(n)
1	1
2	3
3	4
4	6
5	2
6	9
7	7
8	12
9	10
10	15
11	5
12	18
13	13
14	21
15	16
16	24
17	8
18	27
19	19
20	30
21	22
22	33
23	11
24	36
25	25
26	39
27	28
28	42
29	14
30	45
31	31
32	48
33	34
34	51
35	17
36	54
37	37
38	57
39	40
40	60
41	20
42	63
43	43
44	66
45	46
46	69
47	23
48	72
49	49
50	75
51	52
52	78
53	26
54	81
55	55
56	84
57	58
58	87
59	29
60	90
61	61
62	93
63	64
64	96
65	32
66	99
67	67
68	102
69	70
70	105
71	35
72	108
73	73
74	111
75	76
76	114
77	38
78	117
79	79

cp's OEIS Frontend

A261728 a(1)=1; a(2*n) = 3*n; for odd n>1, a(n) is the smallest number not already present which is entailed by the rules (i) k present => 3*k+1 present; (ii) 2*k present => k present.

Table of values

List of values

A261728 a(1)=1; a(2n) = 3n; for odd n>1, a(n) is the smallest number not already present which is entailed by the rules (i) k present => 3k+1 present; (ii) 2k present => k present.

n	a(n)
1	1
2	3
3	4
4	6
5	2
6	9
7	7
8	12
9	10
10	15
11	5
12	18
13	13
14	21
15	16
16	24
17	8
18	27
19	19
20	30
21	22
22	33
23	11
24	36
25	25
26	39
27	28
28	42
29	14
30	45
31	31
32	48
33	34
34	51
35	17
36	54
37	37
38	57
39	40
40	60
41	20
42	63
43	43
44	66
45	46
46	69
47	23
48	72
49	49
50	75
51	52
52	78
53	26
54	81
55	55
56	84
57	58
58	87
59	29
60	90
61	61
62	93
63	64
64	96
65	32
66	99
67	67
68	102
69	70
70	105
71	35
72	108
73	73
74	111
75	76
76	114
77	38
78	117
79	79