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.

A060411 In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives iterate where maximal value is reached in the trajectory with that start.

Table of values

n a(n)
1 0
2 2
3 3
4 4
5 45
6 8
7 31
8 14
9 48
10 28
11 49
12 33
13 26
14 50
15 35
16 43
17 67
18 39
19 69
20 39
21 35
22 124
23 83
24 37
25 132
26 46
27 81
28 75
29 83
30 118
31 68
32 42
33 72
34 97
35 98
36 75
37 92
38 199
39 109
40 92
41 92
42 160
43 91
44 197
45 119
46 113
47 109
48 124
49 176
50 217
51 234
52 276
53 172
54 164
55 233
56 101
57 109
58 158
59 157

List of values

[0, 2, 3, 4, 45, 8, 31, 14, 48, 28, 49, 33, 26, 50, 35, 43, 67, 39, 69, 39, 35, 124, 83, 37, 132, 46, 81, 75, 83, 118, 68, 42, 72, 97, 98, 75, 92, 199, 109, 92, 92, 160, 91, 197, 119, 113, 109, 124, 176, 217, 234, 276, 172, 164, 233, 101, 109, 158, 157]