A320004 - cp's OEIS frontend

A320004 Filter sequence combining the largest proper divisor of n (A032742) with n's residue modulo 4 (A010873), and a single bit (A319710) telling whether the smallest prime factor is unitary.

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

[1, 2, 3, 4, 5, 6, 3, 7, 8, 9, 3, 10, 5, 11, 12, 13, 5, 14, 3, 15, 16, 17, 3, 18, 19, 20, 21, 22, 5, 23, 3, 24, 25, 26, 27, 28, 5, 29, 30, 31, 5, 32, 3, 33, 34, 35, 3, 36, 37, 38, 39, 40, 5, 41, 42, 43, 44, 45, 3, 46, 5, 47, 48, 49, 50, 51, 3, 52, 53, 54, 3, 55, 5, 56, 57, 58, 25, 59, 3, 60, 61, 62, 3, 63, 64, 65, 66, 67, 5, 68, 30, 69, 70, 71, 72, 73, 5, 74, 75, 76, 5, 77, 3]

cp's OEIS Frontend

A320004 Filter sequence combining the largest proper divisor of n (A032742) with n's residue modulo 4 (A010873), and a single bit (A319710) telling whether the smallest prime factor is unitary.

Table of values

List of values

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

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

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