Least m such that m and m+n are both products of exactly n primes counting multiplicity.

A098515

Least m such that m and m+n are both products of exactly n primes counting multiplicity.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =27a(4) =36a(5) =675a(6) =810a(7) =12393a(8) =7552a(9) =268992a(10) =506240a(11) =6436341a(12) =2440692a(13) =290698227a(14) =455503986a(15) =4897228800a(16) =520575984a(17) =519417147375a(18) =124730265582a(20) =753891573760

External references