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

A358205

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

Terms

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

External references