26771144401
domain: N
Appears in sequences
- Primes of the form lcm(1, ..., n) + 1 = A003418(n) + 1.at n=8A049536
- a(n) = 1 + lcm(1..k) where k is the n-th prime power A000961(n).at n=14A051452
- a(n) is the smallest prime factor of 1 + lcm(1..k) where k is the n-th prime power A000961(n).at n=14A051454
- a(n) is the smallest prime > LCM(1,...,x), where x is the n-th prime power (A000961).at n=14A058017
- Primes closest to LCM(1,...,x) either above or below. Arguments x were selected from A000961 (powers of primes including primes) in order to obtain distinct values of LCM exactly once.at n=13A058029
- a(n) = smallest prime > lcm(1..n).at n=25A060357
- a(n) = smallest prime > lcm(1..n).at n=26A060357
- Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=24A070858
- Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=25A070858
- a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=25A075059
- a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=26A075059
- The smallest integer > 1 of exactly n consecutive integers divisible respectively by the first n natural numbers (A000027), or 0 if no such number exists.at n=25A249051