A319994 - cp's OEIS frontend

A319994 Let g = A006530(n), the largest prime factor of n. This filter sequence combines (g mod 4), n/g (A052126), and a single bit A319988(n) telling whether the largest 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	6
15	11
16	12
17	5
18	13
19	3
20	14
21	15
22	6
23	3
24	16
25	17
26	9
27	18
28	10
29	5
30	19
31	3
32	20
33	15
34	9
35	21
36	22
37	5
38	6
39	11
40	23
41	5
42	24
43	3
44	10
45	25
46	6
47	3
48	26
49	27
50	28
51	11
52	14
53	5
54	29
55	21
56	16
57	15
58	9
59	3
60	30
61	5
62	6
63	31
64	32
65	33
66	24
67	3
68	14
69	15
70	34
71	3
72	35
73	5
74	9
75	36
76	10
77	37
78	19
79	3
80	38
81	39
82	9
83	3
84	40
85	33
86	6
87	11
88	16
89	5
90	41
91	42
92	10
93	15
94	6
95	21
96	43
97	5
98	44
99	31
100	45
101	5
102	19
103	3
104	23
105	46

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

cp's OEIS Frontend

A319994 Let g = A006530(n), the largest prime factor of n. This filter sequence combines (g mod 4), n/g (A052126), and a single bit A319988(n) telling whether the largest 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	6
15	11
16	12
17	5
18	13
19	3
20	14
21	15
22	6
23	3
24	16
25	17
26	9
27	18
28	10
29	5
30	19
31	3
32	20
33	15
34	9
35	21
36	22
37	5
38	6
39	11
40	23
41	5
42	24
43	3
44	10
45	25
46	6
47	3
48	26
49	27
50	28
51	11
52	14
53	5
54	29
55	21
56	16
57	15
58	9
59	3
60	30
61	5
62	6
63	31
64	32
65	33
66	24
67	3
68	14
69	15
70	34
71	3
72	35
73	5
74	9
75	36
76	10
77	37
78	19
79	3
80	38
81	39
82	9
83	3
84	40
85	33
86	6
87	11
88	16
89	5
90	41
91	42
92	10
93	15
94	6
95	21
96	43
97	5
98	44
99	31
100	45
101	5
102	19
103	3
104	23
105	46

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

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