106696590

Appears in sequences

• Increasing sequence obtained by union of two sequences A136354 and {b(n)}, where b(n) is the smallest composite number m such that m+1 is prime and the set of distinct prime factors of m consists of the first n primes.at n=14A136357
• Increasing sequence obtained by union of two sequences {b(n)} and {c(n)}, where b(n) is the smallest odd composite number m such that both m-2 and m+2 are prime and the set of distinct prime factors of m consists of the first n odd primes and c(n) is the smallest composite number m such that both m-1 and m+1 are primes and the set of the distinct prime factors of m consists of the first n primes.at n=13A136358
• Numbers with exactly 8 distinct prime divisors {2,3,5,7,11,13,17,19}.at n=10A147575
• (-1)^(n+1)*n*A174276(n).at n=11A174356
• a(n) gives the denominators for A250031(n) as well as for A250032(n).at n=21A250033
• Numbers k where records occur for phi(k+1)/phi(k), where phi is the Euler totient function (A000010).at n=15A335069
• Resistance values R < 1 ohm, multiplied by a common denominator 232792560 (= A338600(7)), that can be obtained from a network of exactly 7 one-ohm resistors, but not from any network with fewer than 7 one-ohm resistors.at n=19A338607
• a(n) is the least multiple of the n-th primorial such that both a(n)-1 and a(n)+1 are prime and the prime factors of a(n) do not exceed prime(n).at n=7A382785