6548416001domain: NAppears in sequencesa(n) is the smallest prime p such that p-1 and p+1 both have n prime factors (with multiplicity).at n=13A154598a(n) = smallest number k such that k-1 and k+1 both have exactly n prime divisors (counted with multiplicity).at n=14A154704