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.

A054995 A version of Josephus problem: a(n) is the surviving integer under the following elimination process. Arrange 1,2,3,...,n in a circle, increasing clockwise. Starting with i=1, delete the integer two places clockwise from i. Repeat, counting two places from the next undeleted integer, until only one integer remains.

Table of values

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

List of values

[1, 2, 2, 1, 4, 1, 4, 7, 1, 4, 7, 10, 13, 2, 5, 8, 11, 14, 17, 20, 2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 1, 4, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 2, 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 1, 4, 7, 10, 13, 16, 19, 22, 25]