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.

A074473 Dropping time for the 3x+1 problem: for n >= 2, number of iteration that first becomes smaller than the initial value if Collatz-function (A006370) is iterated starting at n; a(1)=1 by convention.

Table of values

n a(n)
1 1
2 2
3 7
4 2
5 4
6 2
7 12
8 2
9 4
10 2
11 9
12 2
13 4
14 2
15 12
16 2
17 4
18 2
19 7
20 2
21 4
22 2
23 9
24 2
25 4
26 2
27 97
28 2
29 4
30 2
31 92
32 2
33 4
34 2
35 7
36 2
37 4
38 2
39 14
40 2
41 4
42 2
43 9
44 2
45 4
46 2
47 89
48 2
49 4
50 2
51 7
52 2
53 4
54 2
55 9
56 2
57 4
58 2
59 12
60 2
61 4
62 2
63 89
64 2
65 4
66 2
67 7
68 2
69 4
70 2
71 84
72 2
73 4
74 2
75 9
76 2
77 4
78 2
79 14
80 2
81 4
82 2
83 7
84 2
85 4
86 2
87 9
88 2
89 4
90 2
91 74
92 2
93 4
94 2
95 14
96 2
97 4
98 2
99 7

List of values

[1, 2, 7, 2, 4, 2, 12, 2, 4, 2, 9, 2, 4, 2, 12, 2, 4, 2, 7, 2, 4, 2, 9, 2, 4, 2, 97, 2, 4, 2, 92, 2, 4, 2, 7, 2, 4, 2, 14, 2, 4, 2, 9, 2, 4, 2, 89, 2, 4, 2, 7, 2, 4, 2, 9, 2, 4, 2, 12, 2, 4, 2, 89, 2, 4, 2, 7, 2, 4, 2, 84, 2, 4, 2, 9, 2, 4, 2, 14, 2, 4, 2, 7, 2, 4, 2, 9, 2, 4, 2, 74, 2, 4, 2, 14, 2, 4, 2, 7]