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.

A198789 Array T(n,k) read by antidiagonals: Last survivor positions in Josephus problem for n numbers and a count of k, n >= 1, k >= 1.

Table of values

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

List of values

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