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.

A088443 A linear version of the Josephus problem: a(n) = the function w_3(n).

Table of values

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

List of values

[1, 2, 1, 4, 1, 1, 7, 8, 8, 1, 2, 1, 2, 5, 14, 14, 17, 17, 17, 17, 14, 2, 1, 4, 1, 1, 2, 4, 4, 5, 11, 32, 31, 34, 31, 31, 37, 38, 38, 38, 41, 37, 38, 37, 38, 31, 31, 1, 4, 5, 1, 7, 8, 8, 1, 2, 1, 2, 5, 4, 1, 8, 8, 8, 8, 11, 11, 20, 23, 25, 71, 71, 68, 70, 68, 76, 74, 68, 68, 68, 70, 82, 83, 82]