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.

A351089 Number of iterations of map x -> A003415(x) needed to reach a number >= A276086(n), when starting from x = n, or -1 if such number is never reached.

Table of values

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

List of values

[-1, -1, -1, -1, -1, -1, 0, -1, 2, -1, -1, -1, 2, -1, -1, 6, 4, -1, -1, -1, 6, -1, -1, -1, 6, -1, 11, -1, 8, -1, 0, 0, 0, -1, -1, 5, 0, -1, -1, 5, 7, -1, -1, -1, 4, 8, -1, -1, 4, -1, 10, 10, 8, -1, 7, 10, 8, -1, -1, -1, 0, -1, -1, 8, 2, -1, -1, -1, 6, 11, -1, -1, 6, -1, 10, 10, 8, -1, -1, -1, 7, 9, -1, -1, 7, -1, 14, 11, 9]