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.

A096335 Number of iterations of n -> n + tau(n) needed for the trajectory of n to join the trajectory of A064491, or -1 if the two trajectories never merge.

Table of values

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

List of values

[0, 0, 2, 0, 1, 3, 0, 1, 0, 2, 8, 0, 7, 1, 6, 5, 6, 0, 5, 3, 4, 3, 4, 0, 3, 2, 13, 2, 13, 1, 12, 0, 11, 1, 10, 8, 10, 0, 9, 7, 9, 0, 8, 1, 7, 1, 8, 6, 7, 0, 6, 6, 6, 5, 5, 0, 4, 5, 4, 26, 3, 4, 2, 0, 2, 3, 2, 3, 1, 2, 0, 25, 0, 2, 0, 2, 1, 1, 1, 1, 0, 1, 39, 24, 38]