Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Oct 26 2023 00:42:48
%S 3,5,11,31,17,61,113,79,41,179,353,43,191,109,23,211,317,199,443,577,
%T 151,881,1039,541,7,977,1381,557,1627,101,1231,1993,421,2339,1783,293,
%U 3011,499,173,3847,733,1091,367,2659,2273,1879,1481,3169,47,1409,1867
%N 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).
%C 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
%H Pontus von Brömssen, <a href="/A093933/b093933.txt">Table of n, a(n) for n = 1..911</a>
%e 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.
%Y Cf. A093932.
%K nonn,fini,full
%O 1,1
%A _Amarnath Murthy_, Apr 25 2004
%E a(13)-a(31) from _Stefan Steinerberger_, Nov 10 2005
%E Corrected and extended by _David Wasserman_, Mar 09 2007
%E Clarified definition. - _N. J. A. Sloane_, Oct 26 2023