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.

A381329 Number of steps for n to reach 1 under the map x -> x/2 if x is even, x -> 2*x+1 if x is prime or a perfect power, otherwise x -> gpf(x)-1 where gpf(x) = A006530(x).

Table of values

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

List of values

[0, 1, 5, 2, 16, 6, 4, 3, 10, 17, 15, 7, 20, 5, 3, 4, 8, 11, 9, 18, 7, 16, 14, 8, 6, 21, 19, 6, 7, 4, 8, 5, 18, 9, 7, 12, 4, 10, 8, 19, 23, 8, 8, 17, 3, 15, 13, 9, 19, 7, 5, 22, 11, 20, 18, 7, 12, 8, 6, 5, 21, 9, 7, 6, 8, 19, 4, 10, 17, 8, 9, 13, 8, 5, 3, 11, 18]