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.

A088333 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 3 places clockwise from i. Repeat, counting 3 places from the next undeleted integer, until only one integer remains.

Table of values

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

List of values

[1, 1, 2, 2, 1, 5, 2, 6, 1, 5, 9, 1, 5, 9, 13, 1, 5, 9, 13, 17, 21, 3, 7, 11, 15, 19, 23, 27, 2, 6, 10, 14, 18, 22, 26, 30, 34, 38, 3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 55, 59, 63, 67, 2, 6, 10, 14, 18, 22, 26, 30, 34, 38, 42]