A291317 - cp's OEIS frontend

A291317 A variation of the Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, at k-th stage, move k places clockwise and delete the current number.

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

[1, 1, 1, 3, 4, 3, 7, 7, 6, 10, 7, 12, 3, 10, 11, 7, 11, 1, 12, 6, 21, 1, 7, 12, 25, 3, 25, 28, 16, 26, 25, 6, 32, 19, 15, 21, 28, 3, 12, 21, 24, 13, 21, 36, 17, 45, 41, 45, 8, 40, 11, 6, 25, 41, 23, 4, 43, 52, 51, 57, 28, 21, 11, 47, 26, 29, 57, 51, 48, 56, 12]

cp's OEIS Frontend

A291317 A variation of the Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, at k-th stage, move k places clockwise and delete the current number.

Table of values

List of values

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

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

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