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.

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

Table of values

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

List of values

[1, 2, 1, 2, 2, 1, 6, 3, 8, 3, 8, 1, 6, 11, 1, 6, 11, 16, 2, 7, 12, 17, 22, 3, 8, 13, 18, 23, 28, 3, 8, 13, 18, 23, 28, 33, 1, 6, 11, 16, 21, 26, 31, 36, 41, 46, 4, 9, 14, 19, 24, 29, 34, 39, 44, 49, 54, 1, 6, 11, 16, 21, 26, 31, 36, 41, 46, 51, 56, 61, 66, 71, 3, 8, 13, 18, 23, 28, 33, 38]