38952576

Appears in sequences

• a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n.at n=25A092913
• a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n.at n=26A092913
• a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n.at n=27A092913
• a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n.at n=28A092913
• a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n.at n=29A092913
• a(0) = 1; a(n) = least multiple of a(n-1) such that every k with a(n)-n <= k <= a(n) + n is composite. The least distance of a prime on either side from a(n) is >n.at n=30A092913