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.

A090569 The survivor w(n,2) in a modified Josephus problem, with a step of 2.

Table of values

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

List of values

[1, 1, 3, 3, 1, 1, 3, 3, 9, 9, 11, 11, 9, 9, 11, 11, 1, 1, 3, 3, 1, 1, 3, 3, 9, 9, 11, 11, 9, 9, 11, 11, 33, 33, 35, 35, 33, 33, 35, 35, 41, 41, 43, 43, 41, 41, 43, 43, 33, 33, 35, 35, 33, 33, 35, 35, 41, 41, 43, 43, 41, 41, 43, 43, 1, 1, 3, 3, 1, 1, 3, 3, 9, 9, 11, 11, 9, 9, 11, 11, 1, 1]

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

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