A334473 - cp's OEIS frontend

A334473 The n-cowboy shootout problem: a(3^k) = 3^k, a((3^k)+b) = b if (3^k)+b <= 23^k, otherwise a((3^k)+b) = 2b-3^k, where b is a positive integer.

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

[1, 1, 3, 1, 2, 3, 5, 7, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69]

cp's OEIS Frontend

A334473 The n-cowboy shootout problem: a(3^k) = 3^k, a((3^k)+b) = b if (3^k)+b <= 23^k, otherwise a((3^k)+b) = 2b-3^k, where b is a positive integer.

Table of values

List of values

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

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

cp's OEIS Frontend

A334473 The n-cowboy shootout problem: a(3^k) = 3^k, a((3^k)+b) = b if (3^k)+b <= 2*3^k, otherwise a((3^k)+b) = 2*b-3^k, where b is a positive integer.

Table of values

List of values

A334473 The n-cowboy shootout problem: a(3^k) = 3^k, a((3^k)+b) = b if (3^k)+b <= 23^k, otherwise a((3^k)+b) = 2b-3^k, where b is a positive integer.

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