158800433792domain: NAppears in sequencesLet b(0)=0. For n >= 1, b(n) is the least k > b(n-1)+1 such that k divides (k-1)!/b(n-1)!, and a(n) = (b(n)-1)!/(b(n-1)!*b(n)).at n=6A079759Duplicate of A079759.at n=6A109894