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.

A060565 Follow trajectory of 2n+1 in the '3x+1' problem until a lower number is reached; A060445 gives number of steps for this to happen. Sequence gives the first lower number that is reached.

Table of values

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

List of values

[2, 4, 5, 7, 10, 10, 10, 13, 11, 16, 20, 19, 23, 22, 23, 25, 20, 28, 38, 31, 37, 34, 46, 37, 29, 40, 47, 43, 38, 46, 61, 49, 38, 52, 61, 55, 64, 58, 76, 61, 47, 64, 74, 67, 61, 70, 91, 73, 56, 76, 61, 79, 91, 82, 61, 85, 65, 88, 101, 91, 118, 94, 77, 97, 74, 100, 86, 103]