232792561

Properties

Appears in sequences

• Primes of the form lcm(1, ..., n) + 1 = A003418(n) + 1.at n=7A049536
• a(n) = 1 + lcm(1..k) where k is the n-th prime power A000961(n).at n=12A051452
• a(n) is the smallest prime factor of 1 + lcm(1..k) where k is the n-th prime power A000961(n).at n=12A051454
• a(n) is the smallest prime > LCM(1,...,x), where x is the n-th prime power (A000961).at n=12A058017
• a(n) = smallest prime > lcm(1..n).at n=19A060357
• a(n) = smallest prime > lcm(1..n).at n=20A060357
• a(n) = smallest prime > lcm(1..n).at n=21A060357
• a(n) = smallest prime > lcm(1..n).at n=22A060357
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=18A070858
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=19A070858
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=20A070858
• Smallest prime == 1 mod L, where L = LCM of 1 to n.at n=21A070858
• Least x greater than 1 such that x^n == 1 (mod i) for each i=1,2,3,...,n.at n=18A071553
• a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=19A075059
• a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=20A075059
• a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=21A075059
• a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=22A075059
• Primes of the form k# + (k+1)# +- 1, where k# = A002110(k) = primorial(k).at n=10A125191
• 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=21A249051
• Least k>1 such that the Euler totient function of powers k^e, 1 <= e <= n, are divisible by the number their divisors, d(k^e).at n=17A272857