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.
A092913
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.
Terms
- a(0) =1a(1) =9a(2) =117a(3) =117a(4) =1404a(5) =5616a(6) =5616a(7) =190944a(8) =190944a(9) =190944a(10) =190944a(11) =190944a(12) =190944a(13) =190944a(14) =190944a(15) =190944a(16) =190944a(17) =190944a(18) =190944a(19) =190944a(20) =190944a(21) =190944a(22) =190944a(23) =3246048a(24) =3246048a(25) =38952576a(26) =38952576a(27) =38952576a(28) =38952576a(29) =38952576
External references
- oeis: A092913