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.

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

Table of values

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

List of values

[1, 1, 1, 4, 4, 1, 7, 4, 1, 7, 4, 10, 7, 13, 10, 16, 13, 1, 16, 4, 19, 7, 22, 10, 25, 13, 1, 16, 4, 19, 7, 22, 10, 25, 13, 28, 16, 31, 19, 34, 22, 37, 25, 40, 28, 43, 31, 46, 34, 49, 37, 52, 40, 1, 43, 4, 46, 7, 49, 10, 52, 13, 55, 16, 58, 19, 61, 22, 64, 25, 67]

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

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