a(1)= 2. For n > 1, a(n) is the least number k such that k, k - a(n-1) and k + a(n-1) all have n prime divisors counted by multiplicity.
A365852
a(1)= 2. For n > 1, a(n) is the least number k such that k, k - a(n-1) and k + a(n-1) all have n prime divisors counted by multiplicity.
Terms
- a(0) =2a(1) =93a(2) =138a(3) =372a(4) =552a(5) =1488a(6) =2208a(7) =5952a(8) =8832a(9) =23808a(10) =35328a(11) =95232a(12) =141312a(13) =380928a(14) =565248a(15) =1523712a(16) =2260992a(17) =6094848a(18) =9043968a(19) =24379392a(20) =36175872a(21) =97517568a(22) =144703488a(23) =390070272a(24) =578813952a(25) =1560281088a(26) =2315255808a(27) =6241124352a(28) =9261023232a(29) =24964497408
External references
- oeis: A365852