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.

A128982 If in a line of n persons every n-th person is eliminated until only one person is left, which position P should one assume in the original lineup to avoid being eliminated?

Table of values

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

List of values

[1, 1, 2, 2, 4, 2, 6, 2, 6, 6, 10, 2, 12, 2, 6, 8, 16, 2, 18, 2, 16, 18, 22, 2, 22, 12, 16, 8, 28, 2, 30, 2, 28, 18, 22, 12, 36, 2, 6, 8, 40, 2, 42, 2, 30, 42, 46, 2, 42, 14, 40, 30, 52, 2, 36, 24, 52, 54, 58, 2, 60, 2, 6, 30, 48, 24, 66, 2, 30, 18, 70, 2, 72, 2, 6, 20, 60, 18, 78, 2, 72, 78]