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.

A328384 If n is of the form p^p, a(n) = 0, otherwise a(n) gives the number of iterations of x -> A003415(x) needed to reach the first number different from n which is either a prime, or whose degree (A051903) differs from the degree of n. If the degree of the final number is <= that of n, then a(n) = -1 * iteration count.

Table of values

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

List of values

[-1, -1, -1, 0, -1, -1, -1, -1, -1, -1, -1, 1, -1, 1, 1, 1, -1, -1, -1, 1, -2, -1, -1, -1, -1, 2, 0, 1, -1, -1, -1, -1, 2, -1, 1, 3, -1, -3, 1, -1, -1, -1, -1, 1, -1, 1, -1, 3, -1, -2, 1, 1, -1, 1, 1, -1, -2, -1, -1, 2, -1, 3, -1, 2, 1, -1, -1, 1, 3, -1, -1, -1, -1, 2, -1, 1, 1, -1, -1, 5, -1, -1, -1, 2, -2, 1, 1, -1, -1, -1, 1, 1, -2, 1]