A348285 - cp's OEIS frontend

A348285 a(1) = 2; for n > 1, let a(k) be a divisor > 1 of n appearing in all previous terms where k is as large as possible. Then a(n) = n - k. If no such k exists then a(n) = n - m, where a(m) = 1 and m is as large as possible.

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

[2, 1, 1, 3, 2, 1, 1, 3, 1, 5, 2, 1, 1, 3, 1, 5, 2, 1, 1, 3, 1, 5, 2, 1, 3, 3, 1, 5, 2, 1, 1, 3, 1, 5, 1, 4, 2, 1, 7, 3, 3, 1, 1, 7, 4, 9, 4, 1, 5, 1, 10, 5, 3, 1, 3, 9, 2, 1, 1, 3, 2, 1, 3, 3, 13, 2, 5, 2, 5, 1, 1, 4, 2, 1, 6, 3, 33, 2, 5, 1, 5, 4, 3, 1, 4, 8, 4, 1, 1, 7, 1, 5, 10, 16, 3, 1]

cp's OEIS Frontend

A348285 a(1) = 2; for n > 1, let a(k) be a divisor > 1 of n appearing in all previous terms where k is as large as possible. Then a(n) = n - k. If no such k exists then a(n) = n - m, where a(m) = 1 and m is as large as possible.

Table of values

List of values

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

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

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