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.

A357217 Array read by descending antidiagonals: T(n,k) is the number of cycles of the permutation given by the order of elimination in the Josephus problem for n numbers and a count of k; n, 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 2
10 4
11 1
12 1
13 1
14 2
15 5
16 1
17 2
18 2
19 2
20 1
21 6
22 1
23 1
24 1
25 2
26 1
27 1
28 7
29 1
30 2
31 2
32 2
33 1
34 2
35 4
36 8
37 1
38 1
39 3
40 2
41 3
42 3
43 3
44 2
45 9
46 1
47 2
48 2
49 2
50 3
51 2
52 2
53 2
54 1
55 10
56 1
57 1
58 1
59 2
60 1
61 3
62 3
63 2
64 3
65 5
66 11
67 1
68 2
69 2
70 2
71 3
72 2
73 2
74 4
75 5
76 2
77 2
78 12
79 1
80 1
81 1
82 2
83 3
84 1
85 3
86 2
87 3
88 1
89 3
90 2
91 13

List of values

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