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.

A032436 Triangle of third-to-last man to survive in the Josephus problem of n men in a circle with every k-th killed, with 1 <= k <= n and n >= 3.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 4, 1, 1, 3, 1, 2, 5, 3, 1, 2, 1, 1, 2, 6, 1, 4, 3, 3, 1, 1, 2, 7, 3, 1, 1, 2, 4, 1, 1, 2, 8, 1, 4, 1, 3, 3, 5, 1, 1, 4, 9, 3, 2, 5, 1, 5, 1, 1, 4, 3, 2, 10, 1, 5, 1, 1, 3, 8, 2, 1, 1, 1, 2, 11, 3, 1, 5, 6, 4, 2, 4, 3, 1, 1, 1, 7, 12, 5, 2, 3, 2, 1, 9, 4, 5, 7, 1, 1, 6]