A322809 - cp's OEIS frontend

A322809 Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n) = -1 if n is an odd prime, and f(n) = floor(n/2) for all other numbers.

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

[1, 2, 3, 4, 3, 5, 3, 6, 6, 7, 3, 8, 3, 9, 9, 10, 3, 11, 3, 12, 12, 13, 3, 14, 14, 15, 15, 16, 3, 17, 3, 18, 18, 19, 19, 20, 3, 21, 21, 22, 3, 23, 3, 24, 24, 25, 3, 26, 26, 27, 27, 28, 3, 29, 29, 30, 30, 31, 3, 32, 3, 33, 33, 34, 34, 35, 3, 36, 36, 37, 3, 38, 3, 39, 39, 40, 40, 41, 3, 42, 42, 43, 3, 44, 44, 45, 45, 46, 3, 47, 47, 48, 48, 49, 49, 50, 3, 51, 51, 52, 3, 53, 3, 54, 54]

cp's OEIS Frontend

A322809 Lexicographically earliest such sequence a that a(i) = a(j) => f(i) = f(j) for all i, j, where f(n) = -1 if n is an odd prime, and f(n) = floor(n/2) for all other numbers.

Table of values

List of values

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

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

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