A335905 - cp's OEIS frontend

A335905 Number of distinct integers encountered on all possible paths from n to any first encountered powers of 2 (that are excluded from 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.

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

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

cp's OEIS Frontend

A335905 Number of distinct integers encountered on all possible paths from n to any first encountered powers of 2 (that are excluded from 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

List of values

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

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

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