A005427 - cp's OEIS frontend

A005427 Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people.

n	a(n)
1	5
2	7
3	9
4	12
5	16
6	22
7	29
8	39
9	52
10	69
11	92
12	123
13	164
14	218
15	291
16	388
17	517
18	690
19	920
20	1226
21	1635
22	2180
23	2907
24	3876
25	5168
26	6890
27	9187
28	12249
29	16332
30	21776
31	29035
32	38713
33	51618
34	68824
35	91765
36	122353
37	163138
38	217517
39	290023
40	386697
41	515596
42	687461
43	916615
44	1222153
45	1629538
46	2172717
47	2896956
48	3862608
49	5150144
50	6866859
51	9155812
52	12207749
53	16276999
54	21702665
55	28936887
56	38582516
57	51443354

[5, 7, 9, 12, 16, 22, 29, 39, 52, 69, 92, 123, 164, 218, 291, 388, 517, 690, 920, 1226, 1635, 2180, 2907, 3876, 5168, 6890, 9187, 12249, 16332, 21776, 29035, 38713, 51618, 68824, 91765, 122353, 163138, 217517, 290023, 386697, 515596, 687461, 916615, 1222153, 1629538, 2172717, 2896956, 3862608, 5150144, 6866859, 9155812, 12207749, 16276999, 21702665, 28936887, 38582516, 51443354]

cp's OEIS Frontend

A005427 Josephus problem: numbers m such that, when m people are arranged on a circle and numbered 1 through m, the final survivor when we remove every 4th person is one of the first three people.

Table of values

List of values