A136033 - cp's OEIS frontend

A136033 a(n) = smallest number k such that number of prime factors of 2^k-1 is exactly n (counted with multiplicity).

n	a(n)
1	2
2	4
3	6
4	16
5	12
6	18
7	24
8	40
9	54
10	36
11	102
12	110
13	60
14	72
15	108
16	140
17	120
18	156
19	144
20	200
21	216
22	210
23	240
24	180
25	456
26	288
27	336
28	300
29	396
30	480
31	882
32	360
33	468
34	700

[2, 4, 6, 16, 12, 18, 24, 40, 54, 36, 102, 110, 60, 72, 108, 140, 120, 156, 144, 200, 216, 210, 240, 180, 456, 288, 336, 300, 396, 480, 882, 360, 468, 700]

cp's OEIS Frontend

A136033 a(n) = smallest number k such that number of prime factors of 2^k-1 is exactly n (counted with multiplicity).

Table of values

List of values

n	a(n)
1	2
2	4
3	6
4	16
5	12
6	18
7	24
8	40
9	54
10	36
11	102
12	110
13	60
14	72
15	108
16	140
17	120
18	156
19	144
20	200
21	216
22	210
23	240
24	180
25	456
26	288
27	336
28	300
29	396
30	480
31	882
32	360
33	468
34	700

n	a(n)
1	2
2	4
3	6
4	16
5	12
6	18
7	24
8	40
9	54
10	36
11	102
12	110
13	60
14	72
15	108
16	140
17	120
18	156
19	144
20	200
21	216
22	210
23	240
24	180
25	456
26	288
27	336
28	300
29	396
30	480
31	882
32	360
33	468
34	700

n	a(n)
1	2
2	4
3	6
4	16
5	12
6	18
7	24
8	40
9	54
10	36
11	102
12	110
13	60
14	72
15	108
16	140
17	120
18	156
19	144
20	200
21	216
22	210
23	240
24	180
25	456
26	288
27	336
28	300
29	396
30	480
31	882
32	360
33	468
34	700