A379000 - cp's OEIS frontend

A379000 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n is prime > 5, with f(n) = n for all other n.

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

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

cp's OEIS Frontend

A379000 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n is prime > 5, with f(n) = n for all other n.

Table of values

List of values

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

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

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