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.

A261085 Number of steps needed to reach zero when starting from the n-th prime [i.e., setting k to A000040(n)] and repeatedly applying the map that replaces k with k - d(k), where d(k) is the number of divisors of k (A000005).

Table of values

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

List of values

[1, 2, 3, 4, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 15, 17, 19, 20, 22, 23, 24, 26, 16, 18, 20, 21, 22, 22, 23, 24, 23, 24, 25, 26, 28, 29, 31, 33, 33, 34, 36, 37, 39, 40, 40, 41, 44, 47, 34, 35, 49, 51, 52, 54, 54, 55, 57, 58, 59, 58, 59, 62, 48, 49, 50, 66, 69, 71, 73, 74, 74, 76, 55, 57, 59, 60, 61, 63, 63, 65, 68, 69, 71, 72, 74, 62, 64, 65, 66, 67, 67, 70, 72, 73, 75, 76, 77, 80, 81, 75, 77, 79, 79, 81]