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.

A341216 Triangle read by columns T(n,k) k > n >= 1: Last survivor positions in a modified Josephus problem for n numbers, where after each deletion the counting starts over at the lowest existing number n, rather than continuing from the current position.

Table of values

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

List of values

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