A332900 - cp's OEIS frontend

A332900 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n > 1 and n is a square or twice square, with f(n) = n for all other numbers.

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

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

cp's OEIS Frontend

A332900 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j), where f(n) = 0 if n > 1 and n is a square or twice square, with f(n) = n for all other numbers.

Table of values

List of values

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

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

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