a(n) = smallest number k such that k-1 and k+1 both have exactly n prime divisors (counted with multiplicity).
A154704
a(n) = smallest number k such that k-1 and k+1 both have exactly n prime divisors (counted with multiplicity).
Terms
- a(0) =4a(1) =5a(2) =19a(3) =55a(4) =271a(5) =1889a(6) =10529a(7) =59777a(8) =101249a(9) =406783a(10) =6581249a(11) =12164095a(12) =65071999a(13) =652963841a(14) =6548416001a(15) =13858918399a(16) =145046192129a(17) =75389157377a(18) =943344975871
External references
- oeis: A154704