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.

A377403 For n >= 2, a(n) is the number of iterations needed for the map: x -> x / A085392(x) if A085392(x) > 1, otherwise x -> x + A151800(x), to (the first occurrence of) 2.

Table of values

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

List of values

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