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.

A057033 Let P(n) of a sequence s(1),s(2),s(3),... be obtained by leaving s(1),...s(n-1) fixed and reverse-cyclically permuting every n consecutive terms thereafter; apply P(2) to 1,2,3,... to get PS(2), then apply P(3) to PS(2) to get PS(3), then apply P(4) to PS(3), etc. The limit of PS(n) is A057033.

Table of values

n a(n)
1 1
2 3
3 5
4 2
5 9
6 11
7 6
8 15
9 17
10 10
11 21
12 12
13 4
14 27
15 29
16 18
17 19
18 35
19 22
20 39
21 41
22 8
23 45
24 28
25 30
26 51
27 36
28 34
29 57
30 59
31 14
32 43
33 65
34 42
35 69
36 71
37 24
38 53
39 77
40 7
41 81
42 60
43 54
44 87
45 64
46 58
47 67
48 95
49 26
50 99
51 101
52 37
53 105
54 107
55 70
56 111
57 84
58 32
59 88
60 93
61 78
62 47

List of values

[1, 3, 5, 2, 9, 11, 6, 15, 17, 10, 21, 12, 4, 27, 29, 18, 19, 35, 22, 39, 41, 8, 45, 28, 30, 51, 36, 34, 57, 59, 14, 43, 65, 42, 69, 71, 24, 53, 77, 7, 81, 60, 54, 87, 64, 58, 67, 95, 26, 99, 101, 37, 105, 107, 70, 111, 84, 32, 88, 93, 78, 47]