A093933 a(1) = 3; for n >= 1, a(n+1) is the least odd prime not already used such that abs(a(n+1)-a(n)) is a multiple of prime(n).

3, 5, 11, 31, 17, 61, 113, 79, 41, 179, 353, 43, 191, 109, 23, 211, 317, 199, 443, 577, 151, 881, 1039, 541, 7, 977, 1381, 557, 1627, 101, 1231, 1993, 421, 2339, 1783, 293, 3011, 499, 173, 3847, 733, 1091, 367, 2659, 2273, 1879, 1481, 3169, 47, 1409, 1867

Offset

1,1

Comments

a(911) = 7109 = prime(911), so the sequence ends here. The smallest primes not included are 2, 13, 19, 29 and 37. - David Wasserman, Mar 09 2007

Links

Pontus von Brömssen, Table of n, a(n) for n = 1..911

Example

a(5) = 17 hence a(6) = 61, since (61-17) = 44 == 0 (mod (prime(5))), prime(5) = 11. 17 + 22 = 39 is not a prime.

Crossrefs

Cf. A093932.

Sequence in context: A262936 A214089 A108259 * A165572 A246901 A236568

Adjacent sequences: A093930 A093931 A093932 * A093934 A093935 A093936

Keyword

nonn,fini,full

Author

Amarnath Murthy, Apr 25 2004

Extensions

a(13)-a(31) from Stefan Steinerberger, Nov 10 2005

Corrected and extended by David Wasserman, Mar 09 2007

Clarified definition. - N. J. A. Sloane, Oct 26 2023

Status

approved