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.

A179329 Number of iterations of (n + lpf(n)) / 2 required to reach a prime, where lpf equals the least prime factor.

Table of values

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

List of values

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