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.

A353515 The length of the shortest path from n to 1 when using the transitions x -> A003415(x) and x -> A003961(x), or -1 if no 1 can ever be reached from n.

Table of values

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

List of values

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