A334869 - cp's OEIS frontend

A334869 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j) for all i, j >= 1, where f(1) = 0 and for n > 1, f(n) = A334870(n).

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

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

cp's OEIS Frontend

A334869 Lexicographically earliest infinite sequence such that a(i) = a(j) => f(i) = f(j) for all i, j >= 1, where f(1) = 0 and for n > 1, f(n) = A334870(n).

Table of values

List of values

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

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

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