A209258 - cp's OEIS frontend

A209258 The original Josephus problem: 41 soldiers are arranged in a ring, and every third man is killed by his neighbor, until only the last person remains, who would kill himself. Sequence shows soldier killing order.

n	a(n)
1	3
2	6
3	9
4	12
5	15
6	18
7	21
8	24
9	27
10	30
11	33
12	36
13	39
14	1
15	5
16	10
17	14
18	19
19	23
20	28
21	32
22	37
23	41
24	7
25	13
26	20
27	26
28	34
29	40
30	8
31	17
32	29
33	38
34	11
35	25
36	2
37	22
38	4
39	35
40	16
41	31

[3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 1, 5, 10, 14, 19, 23, 28, 32, 37, 41, 7, 13, 20, 26, 34, 40, 8, 17, 29, 38, 11, 25, 2, 22, 4, 35, 16, 31]

cp's OEIS Frontend

A209258 The original Josephus problem: 41 soldiers are arranged in a ring, and every third man is killed by his neighbor, until only the last person remains, who would kill himself. Sequence shows soldier killing order.

Table of values

List of values

n	a(n)
1	3
2	6
3	9
4	12
5	15
6	18
7	21
8	24
9	27
10	30
11	33
12	36
13	39
14	1
15	5
16	10
17	14
18	19
19	23
20	28
21	32
22	37
23	41
24	7
25	13
26	20
27	26
28	34
29	40
30	8
31	17
32	29
33	38
34	11
35	25
36	2
37	22
38	4
39	35
40	16
41	31

n	a(n)
1	3
2	6
3	9
4	12
5	15
6	18
7	21
8	24
9	27
10	30
11	33
12	36
13	39
14	1
15	5
16	10
17	14
18	19
19	23
20	28
21	32
22	37
23	41
24	7
25	13
26	20
27	26
28	34
29	40
30	8
31	17
32	29
33	38
34	11
35	25
36	2
37	22
38	4
39	35
40	16
41	31

n	a(n)
1	3
2	6
3	9
4	12
5	15
6	18
7	21
8	24
9	27
10	30
11	33
12	36
13	39
14	1
15	5
16	10
17	14
18	19
19	23
20	28
21	32
22	37
23	41
24	7
25	13
26	20
27	26
28	34
29	40
30	8
31	17
32	29
33	38
34	11
35	25
36	2
37	22
38	4
39	35
40	16
41	31