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.

A384908 Start with a list L of positive integers. At each step n, let the center be the smallest number that has not been used as a center before with index m > 1. For all i < m, swap L(i) with L(i+m). a(n) = L(1).

Table of values

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

List of values

[3, 4, 2, 5, 7, 1, 3, 9, 11, 4, 12, 6, 16, 15, 17, 5, 12, 19, 21, 8, 20, 23, 25, 10, 24, 27, 23, 21, 11, 31, 33, 34, 32, 35, 37, 31, 16, 33, 15, 41, 43, 17, 44, 18, 12, 47, 49, 50, 48, 51, 53, 47, 49, 55, 57, 50, 22, 59, 61, 26, 60, 29, 64, 66, 61, 67, 69, 70, 68, 65, 72, 28, 64, 75, 54, 27, 78, 80, 56]