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.

A198790 Irregular table T(n,k) read by rows: Last survivor positions in Josephus problem for n numbers and a count of k, n >= 1, lcm(1, 2, 3, ..., n) >= k >= 1.

Table of values

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

List of values

[1, 2, 1, 3, 3, 2, 2, 1, 1, 4, 1, 1, 2, 2, 3, 2, 3, 3, 4, 4, 1, 5, 3, 4, 1, 2, 4, 4, 1, 2, 4, 5, 3, 2, 5, 1, 3, 4, 1, 1, 3, 4, 1, 2, 5, 4, 2, 3, 5, 1, 3, 3, 5, 1, 3, 4, 2, 1, 4, 5, 2, 3, 5, 5, 2, 3, 5, 1, 4, 3, 1, 2, 4, 5, 2, 2, 4, 5, 2, 3, 1, 6, 5, 1, 5, 1, 4]