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.

A088442 A linear version of the Josephus problem.

Table of values

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

List of values

[1, 3, 1, 3, 9, 11, 9, 11, 1, 3, 1, 3, 9, 11, 9, 11, 33, 35, 33, 35, 41, 43, 41, 43, 33, 35, 33, 35, 41, 43, 41, 43, 1, 3, 1, 3, 9, 11, 9, 11, 1, 3, 1, 3, 9, 11, 9, 11, 33, 35, 33, 35, 41, 43, 41, 43, 33, 35, 33, 35, 41, 43, 41, 43, 129, 131, 129, 131, 137, 139, 137, 139, 129, 131]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.