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.

A335552 Triangle T(n,k) read by rows: in the Josephus problem with n initial numbers on a line: eliminate each second and reverse left-right-direction of elimination. T(n,k) is the (n-k+1)st element removed, 1<=k<=n.

Table of values

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

List of values

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