A276770 - cp's OEIS frontend

A276770 a(n) is the number of runs of an algorithm. Set b_0 = n, if prime, stop; else, set c_0 = largest divisor of n (!=n); set b_1 = c_0 + b_0/c_0. Run with b_1.

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

[0, 1, 0, 2, 2, 1, 0, 3, 0, 3, 3, 2, 0, 1, 0, 4, 2, 1, 0, 4, 2, 4, 4, 3, 0, 1, 0, 2, 4, 1, 4, 5, 0, 3, 3, 2, 0, 1, 0, 5, 2, 3, 0, 5, 4, 5, 5, 4, 0, 1, 3, 2, 2, 1, 0, 3, 0, 5, 5, 2, 2, 5, 0, 6, 5, 1, 0, 4, 0, 4, 4, 3, 2, 1, 0, 2, 2, 1, 0, 6, 2, 3, 3, 4, 0, 1, 5, 6, 2, 5, 5, 6, 0, 6, 6, 5, 0, 1, 0, 2, 4]

cp's OEIS Frontend

A276770 a(n) is the number of runs of an algorithm. Set b_0 = n, if prime, stop; else, set c_0 = largest divisor of n (!=n); set b_1 = c_0 + b_0/c_0. Run with b_1.

Table of values

List of values

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

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

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