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.

A381129 A version of the Josephus problem: a(n) is the surviving integer under the spelling version of the elimination process, called Down-SpellUnder.

Table of values

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

List of values

[1, 2, 2, 3, 3, 2, 7, 8, 4, 6, 4, 6, 7, 11, 10, 3, 14, 4, 17, 11, 3, 16, 7, 16, 7, 22, 2, 8, 24, 27, 7, 21, 13, 28, 30, 8, 3, 37, 12, 7, 8, 33, 7, 33, 44, 11, 32, 8, 6, 43, 2, 18, 49, 8, 32, 54, 26, 43, 44, 30, 40, 52, 26, 44, 8, 27, 60, 16, 11, 61, 70, 14, 58, 55]