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.

A360268 A version of the 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 5 places clockwise from i. Repeat, counting 5 places from the next undeleted integer, until only one integer remains.

Table of values

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

List of values

[1, 1, 1, 3, 4, 4, 3, 1, 7, 3, 9, 3, 9, 1, 7, 13, 2, 8, 14, 20, 5, 11, 17, 23, 4, 10, 16, 22, 28, 4, 10, 16, 22, 28, 34, 4, 10, 16, 22, 28, 34, 40, 3, 9, 15, 21, 27, 33, 39, 45, 51, 5, 11, 17, 23, 29, 35, 41, 47, 53, 59, 3, 9, 15, 21, 27, 33, 39, 45, 51, 57, 63, 69, 1, 7, 13, 19, 25]