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.

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

List of values

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