360361

Appears in sequences

• a(n) = 1 + lcm(1..k) where k is the n-th prime power A000961(n).at n=9A051452
• Smallest number that is centered polygonal in exactly n ways.at n=25A063773
• Least x greater than 1 such that x^n == 1 (mod i) for each i=1,2,3,...,n.at n=12A071553
• a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=13A075059
• a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=14A075059
• a(n) = 1 + lcm(1, 2, ..., n) = 1 + A003418(n).at n=15A075059
• Concatenation of the decimal digits of n^2-1 and n^2.at n=19A215268
• 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=14A249051
• a(n) = the least integer that is centered polygonal in exactly n ways.at n=24A279830
• Constant term in the expansion of (1 + x^4 + y^4 + 1/(x*y))^n.at n=14A361700
• Constant term in the expansion of (1 + x^4 + y^4 + z^4 + 1/(x*y*z))^n.at n=13A361701
• Highly touchable numbers sandwiched between untouchable twin pairs.at n=7A370355
• Least integer k for which sigma(k - x) + sigma(k + x) >= n*k has at least one solution.at n=7A383921