91729428480
domain: N
Appears in sequences
- a(n) = the least positive integer k satisfying Omega(k) = Omega(k-1)+...+Omega(k-n) if such k exists; = 0 otherwise. (Omega(n) (A001222) denotes the number of prime factors of n, counting multiplicity.)at n=9A076183
- a(1) = 1, a(2) = (2*1)/1 = 2. a(n+1) = (n+1)*a(n) divided by the largest prime divisor of a(n).at n=29A100773
- a(n) = floor(sqrt(n)) * a(n-1), starting with 1.at n=24A195458