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.

A340967 a(n) is the number of iterations of the map x -> n mod sopfr(x) starting with n to reach 0 or 1, where sopfr = A001414.

Table of values

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

List of values

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