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.

A060445 "Dropping time" in 3x+1 problem starting at 2n+1 (number of steps to reach a lower number than starting value). Also called glide(2n+1).

Table of values

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

List of values

[0, 6, 3, 11, 3, 8, 3, 11, 3, 6, 3, 8, 3, 96, 3, 91, 3, 6, 3, 13, 3, 8, 3, 88, 3, 6, 3, 8, 3, 11, 3, 88, 3, 6, 3, 83, 3, 8, 3, 13, 3, 6, 3, 8, 3, 73, 3, 13, 3, 6, 3, 68, 3, 8, 3, 50, 3, 6, 3, 8, 3, 13, 3, 24, 3, 6, 3, 11, 3, 8, 3, 11, 3, 6, 3, 8, 3, 65, 3, 34, 3, 6, 3, 47, 3, 8, 3, 13, 3, 6, 3, 8, 3]