A094758 - cp's OEIS frontend

A094758 Least k <= n such that ntau(k) = ktau(n), where tau(n) is the number of divisors of n (A000005).

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

[1, 1, 3, 4, 5, 3, 7, 8, 9, 5, 11, 8, 13, 7, 15, 16, 17, 9, 19, 20, 21, 11, 23, 9, 25, 13, 27, 28, 29, 15, 31, 32, 33, 17, 35, 36, 37, 19, 39, 40, 41, 21, 43, 44, 45, 23, 47, 48, 49, 25, 51, 52, 53, 27, 55, 56, 57, 29, 59, 40, 61, 31, 63, 64, 65, 33, 67, 68, 69, 35, 71, 72, 73, 37]

cp's OEIS Frontend

A094758 Least k <= n such that ntau(k) = ktau(n), where tau(n) is the number of divisors of n (A000005).

Table of values

List of values

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

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

cp's OEIS Frontend

A094758 Least k <= n such that n*tau(k) = k*tau(n), where tau(n) is the number of divisors of n (A000005).

Table of values

List of values

A094758 Least k <= n such that ntau(k) = ktau(n), where tau(n) is the number of divisors of n (A000005).

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