A358205 - cp's OEIS frontend

A358205 a(n) is the least number k such that 1 + 2k + 3k^2 has exactly n prime divisors, counted with multiplicity.

n	a(n)
0	0
1	2
2	1
3	13
4	19
5	7
6	61
7	331
8	169
9	1141
10	6487
11	898
12	20581
13	315826
14	59947
15	296143
16	1890466
17	6141994
18	1359025
19	49188715
20	20490901
21	264422320
22	178328878
23	1340590345
24	9476420614
25	5989636213
26	72238539832
27	103619599441
28	668478672403
29	794002910839
30	417430195531

[0, 2, 1, 13, 19, 7, 61, 331, 169, 1141, 6487, 898, 20581, 315826, 59947, 296143, 1890466, 6141994, 1359025, 49188715, 20490901, 264422320, 178328878, 1340590345, 9476420614, 5989636213, 72238539832, 103619599441, 668478672403, 794002910839, 417430195531]

cp's OEIS Frontend

A358205 a(n) is the least number k such that 1 + 2k + 3k^2 has exactly n prime divisors, counted with multiplicity.

Table of values

List of values

cp's OEIS Frontend

A358205 a(n) is the least number k such that 1 + 2*k + 3*k^2 has exactly n prime divisors, counted with multiplicity.

Table of values

List of values

A358205 a(n) is the least number k such that 1 + 2k + 3k^2 has exactly n prime divisors, counted with multiplicity.