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.

A375147 a(1) = 0; for n >= 2, a(n) is the number of iterations needed for the map: x -> x / A000005(x) if x is divisible by A000005(x), x -> x + 1 otherwise, to reach 1.

Table of values

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

List of values

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