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.

A060409 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 associated "dropping time", number of steps to reach a lower value than the start.

Table of values

n a(n)
1 1
2 4
3 7
4 7
5 59
6 13
7 40
8 23
9 81
10 61
11 70
12 65
13 54
14 72
15 65
16 59
17 127
18 105
19 110
20 59
21 72
22 164
23 140
24 73
25 170
26 105
27 149
28 97
29 135
30 183
31 99
32 99
33 124
34 156
35 200
36 140
37 222
38 264
39 181
40 243
41 203
42 238
43 262
44 362
45 249
46 183
47 238
48 226
49 243
50 294
51 375
52 455
53 292
54 245
55 414

List of values

[1, 4, 7, 7, 59, 13, 40, 23, 81, 61, 70, 65, 54, 72, 65, 59, 127, 105, 110, 59, 72, 164, 140, 73, 170, 105, 149, 97, 135, 183, 99, 99, 124, 156, 200, 140, 222, 264, 181, 243, 203, 238, 262, 362, 249, 183, 238, 226, 243, 294, 375, 455, 292, 245, 414]