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.

A330155 Triangle read by rows. Given n enumerated cards in a stack, with 1 at the top and n at the bottom, repeat the following process k times: remove the card in the middle (at position (size of the stack)/2, rounding up), and move the card at the bottom of the stack to the top. T(n,k) is the number of the last card removed.

Table of values

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

List of values

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