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.

A164917 Smallest number of steps to reach prime(n) by applying the map x->A060308(x) starting from any member of A164368.

Table of values

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

List of values

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