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.

A377437 Number of multiplication steps for n to reach 1 when iterating 5x+1 removing factors 2 and 3, or -1 if it never reaches 1.

Table of values

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

List of values

[0, 0, 0, 0, 4, 0, 1, 0, 0, 4, 2, 0, 3, 1, 4, 0, 2, 0, 1, 4, 1, 2, 6, 0, 2, 3, 0, 1, 5, 4, 4, 0, 2, 2, 3, 0, 5, 1, 3, 4, 3, 1, 1, 2, 4, 6, 7, 0, 4, 2, 2, 3, 7, 0, 7, 1, 1, 5, 6, 4, 3, 4, 1, 0, 4, 2, 2, 2, 6, 3, 7, 0, 4, 5, 2, 1, 5, 3, 3, 4, 0, 3, 4, 1, 8, 1, 5, 2, 6, 4, 2, 6, 4, 7, 16, 0, 1, 4, 2, 2, 5, 2, 2, 3]