proposed
approved
proposed
approved
editing
proposed
Michael De Vlieger, <a href="/A157419/b157419.txt">Table of n, a(n) for n = 0..10000</a>
Fold[Append[#1, Block[{k = Prime@ #2 + 1}, While[! CoprimeQ[k, #1[[-1]] ], k++]; k]] &, {1}, Range@ 59] (* Michael De Vlieger, Oct 30 2017 *)
approved
editing
__Leroy Quet__, , Feb 28 2009
__Leroy Quet_, _, Feb 28 2009
_Leroy Quet, _, Feb 28 2009
Extended by _Ray Chandler (rayjchandler(AT)sbcglobal.net), _, Jun 19 2009
nonn,new
nonn
Leroy Quet (http://www.prism-of-spirals.net/), , Feb 28 2009
nonn,new
nonn
Leroy Quet (q1qq2qqq3qqqq(AT)yahoohttp://www.prism-of-spirals.comnet/), Feb 28 2009
a(0)=1. a(n) = the smallest integer coprime to a(n-1) and greater than the n-th prime.
1, 3, 4, 7, 8, 13, 14, 19, 20, 27, 31, 32, 39, 43, 44, 49, 54, 61, 62, 69, 73, 74, 81, 85, 91, 99, 103, 104, 109, 110, 117, 128, 133, 138, 143, 150, 157, 158, 165, 169, 174, 181, 182, 193, 194, 199, 200, 213, 224, 229, 230, 237, 241, 242, 255, 259, 264, 271, 272, 279
0,2
a(8) = 20, and the 9th prime is 23. So for a(9) we want the smallest integer that is both coprime to 20 and is > 23. Checking: 24 is not coprime to 20. 25 is not coprime to 20. 26 is not coprime to 20. But 27 is coprime to 20, so a(9) = 27.
nonn
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Feb 28 2009
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 19 2009
approved