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.

A057032 Let P(n) of a sequence s(1), s(2), s(3), ... be obtained by leaving s(1), ..., s(n-1) fixed and forward-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) as n -> oo is this sequence.

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 6
6 10
7 8
8 16
9 15
10 21
11 12
12 22
13 14
14 27
15 28
16 36
17 18
18 33
19 20
20 43
21 35
22 39
23 24
24 53
25 34
26 45
27 46
28 50
29 30
30 66
31 32
32 78
33 52
34 57
35 55
36 81
37 38
38 63
39 59
40 88
41 42
42 86
43 44
44 96
45 87
46 75
47 48
48 119
49 64
50 111
51 76
52 101
53 54
54 103
55 79
56 144
57 83
58 93
59 60
60 141
61 62
62 99
63 113
64 173
65 91
66 136
67 68
68 139

List of values

[1, 3, 4, 7, 6, 10, 8, 16, 15, 21, 12, 22, 14, 27, 28, 36, 18, 33, 20, 43, 35, 39, 24, 53, 34, 45, 46, 50, 30, 66, 32, 78, 52, 57, 55, 81, 38, 63, 59, 88, 42, 86, 44, 96, 87, 75, 48, 119, 64, 111, 76, 101, 54, 103, 79, 144, 83, 93, 60, 141, 62, 99, 113, 173, 91, 136, 68, 139]