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.

A335906 Number of distinct integers encountered on all possible paths from n to any first encountered powers of 2 (that are included in the count), when using the transitions x -> x - (x/p) and x -> x + (x/p) in any order, where p is the largest prime dividing x.

Table of values

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

List of values

[1, 1, 3, 1, 4, 3, 4, 1, 6, 4, 5, 3, 5, 4, 7, 1, 7, 6, 8, 4, 7, 5, 6, 3, 9, 5, 10, 4, 9, 7, 8, 1, 8, 7, 9, 6, 9, 8, 8, 4, 9, 7, 10, 5, 11, 6, 7, 3, 9, 9, 11, 5, 13, 10, 10, 4, 12, 9, 10, 7, 9, 8, 11, 1, 10, 8, 10, 7, 9, 9, 10, 6, 10, 9, 13, 8, 11, 8, 10, 4, 15, 9, 10, 7, 13, 10, 13, 5, 14, 11, 10, 6, 12, 7, 15, 3, 10, 9, 12, 9, 15, 11, 14, 5, 13]