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.

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

Table of values

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

List of values

[1, 2, 2, 2, 5, 5, 2, 8, 5, 2, 8, 5, 11, 8, 14, 11, 17, 14, 2, 17, 5, 20, 8, 23, 11, 26, 14, 2, 17, 5, 20, 8, 23, 11, 26, 14, 29, 17, 32, 20, 35, 23, 38, 26, 41, 29, 44, 32, 47, 35, 50, 38, 53, 41, 2, 44, 5, 47, 8, 50, 11, 53, 14, 56, 17, 59, 20, 62, 23, 65, 26, 68]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.