668478672403domain: NAppears in sequencesa(n) is the least number k such that 1 + 2*k + 3*k^2 has exactly n prime divisors, counted with multiplicity.at n=28A358205