A348533 - cp's OEIS frontend

A348533 Generalized Josephus problem: Let T(m,k), k>=2, m=1,2,3,.., be the number of people on a circle such that the survivor is one of the first k-1 people after every k-th person has been removed.

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

[1, 2, 1, 4, 2, 1, 8, 3, 2, 1, 16, 4, 3, 2, 1, 32, 6, 4, 3, 2, 1, 64, 9, 5, 4, 3, 2, 1, 128, 14, 7, 5, 4, 3, 2, 1, 256, 21, 9, 6, 5, 4, 3, 2, 1, 512, 31, 12, 8, 6, 5, 4, 3, 2, 1, 1024, 47, 16, 10, 7, 6, 5, 4, 3, 2, 1, 2048, 70, 22, 12, 8, 7, 6, 5, 4, 3, 2, 1]

cp's OEIS Frontend

A348533 Generalized Josephus problem: Let T(m,k), k>=2, m=1,2,3,.., be the number of people on a circle such that the survivor is one of the first k-1 people after every k-th person has been removed.

Table of values

List of values