A336146 - cp's OEIS frontend

A336146 Lexicographically earliest infinite sequence such that a(i) = a(j) => A000035(i) = A000035(j) and A000265(i) = A000265(j), for all i, j >= 1.

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

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

cp's OEIS Frontend

A336146 Lexicographically earliest infinite sequence such that a(i) = a(j) => A000035(i) = A000035(j) and A000265(i) = A000265(j), for all i, j >= 1.

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

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

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