|
Search: id:A093933
|
|
|
| A093933 |
|
For n > 0, 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). |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(911) = 7109 = prime(911), so the sequence ends here. The smallest primes not included are 2, 13, 19, 29 and 37. - David Wasserman (dwasserm(AT)earthlink.net), Mar 09 2007
|
|
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: A084748 A146243 A108259 this_sequence A165572 A095184 A048235
Adjacent sequences: A093930 A093931 A093932 this_sequence A093934 A093935 A093936
|
|
KEYWORD
|
nonn,fini,less
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 25 2004
|
|
EXTENSIONS
|
a(13)-a(31) from Stefan Steinerberger (hansibal(AT)hotmail.com), Nov 10 2005
Corrected and extended by David Wasserman (dwasserm(AT)earthlink.net), Mar 09 2007
|
|
|
Search completed in 0.002 seconds
|
