A261690 - cp's OEIS frontend

A261690 a(1) = 1; for 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	4
3	2
4	7
5	13
6	22
7	11
8	34
9	17
10	40
11	20
12	10
13	5
14	16
15	8
16	25
17	31
18	49
19	52
20	26
21	61
22	67
23	76
24	38
25	19
26	58
27	29
28	79
29	88
30	44
31	94
32	47
33	103
34	115
35	121
36	133
37	142
38	71
39	148
40	74
41	37
42	112
43	56
44	28
45	14
46	43
47	85
48	130
49	65
50	157
51	169
52	175
53	184
54	92
55	46
56	23
57	70
58	35
59	106
60	53
61	139
62	160
63	80

[1, 4, 2, 7, 13, 22, 11, 34, 17, 40, 20, 10, 5, 16, 8, 25, 31, 49, 52, 26, 61, 67, 76, 38, 19, 58, 29, 79, 88, 44, 94, 47, 103, 115, 121, 133, 142, 71, 148, 74, 37, 112, 56, 28, 14, 43, 85, 130, 65, 157, 169, 175, 184, 92, 46, 23, 70, 35, 106, 53, 139, 160, 80]

cp's OEIS Frontend

A261690 a(1) = 1; for 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	4
3	2
4	7
5	13
6	22
7	11
8	34
9	17
10	40
11	20
12	10
13	5
14	16
15	8
16	25
17	31
18	49
19	52
20	26
21	61
22	67
23	76
24	38
25	19
26	58
27	29
28	79
29	88
30	44
31	94
32	47
33	103
34	115
35	121
36	133
37	142
38	71
39	148
40	74
41	37
42	112
43	56
44	28
45	14
46	43
47	85
48	130
49	65
50	157
51	169
52	175
53	184
54	92
55	46
56	23
57	70
58	35
59	106
60	53
61	139
62	160
63	80

n	a(n)
1	1
2	4
3	2
4	7
5	13
6	22
7	11
8	34
9	17
10	40
11	20
12	10
13	5
14	16
15	8
16	25
17	31
18	49
19	52
20	26
21	61
22	67
23	76
24	38
25	19
26	58
27	29
28	79
29	88
30	44
31	94
32	47
33	103
34	115
35	121
36	133
37	142
38	71
39	148
40	74
41	37
42	112
43	56
44	28
45	14
46	43
47	85
48	130
49	65
50	157
51	169
52	175
53	184
54	92
55	46
56	23
57	70
58	35
59	106
60	53
61	139
62	160
63	80

cp's OEIS Frontend

A261690 a(1) = 1; for 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

A261690 a(1) = 1; for 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	4
3	2
4	7
5	13
6	22
7	11
8	34
9	17
10	40
11	20
12	10
13	5
14	16
15	8
16	25
17	31
18	49
19	52
20	26
21	61
22	67
23	76
24	38
25	19
26	58
27	29
28	79
29	88
30	44
31	94
32	47
33	103
34	115
35	121
36	133
37	142
38	71
39	148
40	74
41	37
42	112
43	56
44	28
45	14
46	43
47	85
48	130
49	65
50	157
51	169
52	175
53	184
54	92
55	46
56	23
57	70
58	35
59	106
60	53
61	139
62	160
63	80