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.

A380204 A version of the Josephus problem: a(n) is the surviving integer under the spelling version of the elimination process.

Table of values

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

List of values

[1, 1, 2, 2, 1, 6, 7, 3, 5, 3, 5, 6, 10, 9, 2, 13, 3, 16, 10, 2, 15, 6, 15, 6, 21, 1, 7, 23, 26, 6, 20, 12, 27, 29, 7, 2, 36, 11, 6, 7, 32, 6, 32, 43, 10, 31, 7, 5, 42, 1, 17, 48, 7, 31, 53, 25, 42, 43, 29, 39, 51, 25, 43, 7, 26, 59, 15, 10, 60, 69, 13, 57, 54, 66, 57, 30, 9, 35, 64, 9, 65, 1, 15, 3, 79, 47, 86, 7]