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.

A328383 a(n) gives the number of iterations of x -> A003415(x) needed to reach the first number which is either a divisor or multiple of n, but not both at the same time. If no such number can ever be reached, a(n) is 0 (when either n is of the form p^p, or if the iteration would never stop). When the number reached is a divisor of n, a(n) is -1 * iteration count.

Table of values

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

List of values

[-1, -1, 0, -1, -2, -1, 2, -3, -2, -1, 9, -1, -4, 23, 1, -1, -4, -1, 5, -2, -2, -1, 2, -3, 24, 0, 18, -1, -2, -1, 6, -5, -2, 85, 7, -1, -4, 21, 10, -1, -2, -1, 35, 53, -4, -1, 2, -5, 44, 18, 34, -1, 2, 21, 4, -3, -2, -1, 16, -1, -6, 21, 1, -5, -2, -1, 7, 85, -2, -1, 4, -1, 23, 55, 5, -4, -2, -1, 4, 9, -2, -1, 42, -3, 42]