cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A383846 A version of the Josephus problem: a(n) is the surviving integer under the eliminate-eliminate-skip version of the elimination process.

Table of values

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

List of values

[1, 2, 3, 3, 3, 6, 6, 3, 9, 6, 3, 9, 6, 12, 9, 15, 12, 18, 15, 3, 18, 6, 21, 9, 24, 12, 27, 15, 3, 18, 6, 21, 9, 24, 12, 27, 15, 30, 18, 33, 21, 36, 24, 39, 27, 42, 30, 45, 33, 48, 36, 51, 39, 54, 42, 3, 45, 6, 48, 9, 51, 12, 54, 15, 57, 18, 60, 21, 63, 24, 66, 27]