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.

A102419 "Dropping time" in 3x+1 problem starting at n (number of steps to reach a lower number than starting value); a(1) = 0 by convention. Also called glide(n).

Table of values

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

List of values

[0, 1, 6, 1, 3, 1, 11, 1, 3, 1, 8, 1, 3, 1, 11, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 96, 1, 3, 1, 91, 1, 3, 1, 6, 1, 3, 1, 13, 1, 3, 1, 8, 1, 3, 1, 88, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 11, 1, 3, 1, 88, 1, 3, 1, 6, 1, 3, 1, 83, 1, 3, 1, 8, 1, 3, 1, 13, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 73, 1, 3, 1, 13, 1, 3, 1, 6]