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.

A323135 a(n) is the least number of iterations that n requires to reach a power of a prime under the map x -> A070229(x), or -1 if we never reach a power of a prime.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 3, 0, 5, 2, 0, 0, 5, 0, 1, 4, 9, 0, 1, 0, 11, 0, 3, 0, 3, 0, 0, 8, 15, 2, 11, 0, 17, 10, 9, 0, 1, 0, 7, 8, 21, 0, 15, 0, 7, 14, 9, 0, 17, 6, 7, 16, 27, 0, 9, 0, 29, 6, 0, 8, 5, 0, 13, 20, 5, 0, 15, 0, 35, 14, 15, 4, 7, 0, 13, 0]