158399domain: NAppears in sequencesa(n) = smallest M such that M is not divisible by prime(1), ..., prime(n), but is divisible by Sum_{i=1..n} (M mod prime(i)); or 0 if no such M exists.at n=34A106572Strong Lucas pseudoprimes.at n=17A217255