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.

A377524 Number of steps for n to reach the minimum of its final cycle under iterations of the map (A123684): x->(3x-1)/2 if x odd, x/2 otherwise; or -1 if this never happens.

Table of values

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

List of values

[0, 1, 3, 2, 0, 4, 2, 3, 7, 1, 5, 5, 6, 3, 7, 4, 0, 8, 5, 2, 5, 6, 2, 6, 10, 7, 4, 4, 8, 8, 4, 5, 12, 1, 9, 9, 9, 6, 10, 3, 6, 6, 7, 7, 14, 3, 11, 7, 11, 11, 8, 8, 12, 5, 8, 5, 20, 9, 9, 9, 5, 5, 13, 6, 25, 13, 13, 2, 14, 10, 14, 10, 10, 10, 7, 7, 11, 11, 11, 4]