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.

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

Table of values

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

List of values

[1, 1, 1, 4, 3, 6, 3, 6, 9, 3, 6, 9, 12, 1, 4, 7, 10, 13, 16, 19, 1, 4, 7, 10, 13, 16, 19, 22, 25, 28, 31, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 1, 4, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 3, 6]

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

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