login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A338666 a(1)=1 and a(2)=2. For all n > 2, a(n) is the smallest number > a(n-1) by a number > the difference between a(n-1) and a(n-2) so that consecutive terms of sequence are always relatively prime. 2

%I #19 May 08 2021 08:30:37

%S 1,2,5,9,14,23,33,46,61,77,94,113,133,155,178,203,229,256,285,316,349,

%T 383,418,455,493,532,573,616,661,707,754,803,853,904,957,1013,1070,

%U 1129,1189,1250,1313,1377,1442,1509,1577,1646,1717,1789,1862,1937,2013,2092,2173,2256,2341

%N a(1)=1 and a(2)=2. For all n > 2, a(n) is the smallest number > a(n-1) by a number > the difference between a(n-1) and a(n-2) so that consecutive terms of sequence are always relatively prime.

%H Giovanni Resta, <a href="/A338666/b338666.txt">Table of n, a(n) for n = 1..10000</a>

%e Term after 33 cannot be 44 because 33 and 44 have a common factor of 11.

%t a[1]=1; a[2]=2; a[n_]:=a[n]=Module[{d=a[n-1]-a[n-2]+1},While[!CoprimeQ[a[n-1]+d,a[n-1]],d++]; a[n-1]+d];a/@Range[70] (* _Ivan N. Ianakiev_, Apr 23 2021 *)

%K nonn

%O 1,2

%A _J. Lowell_, Apr 22 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 9 09:10 EDT 2024. Contains 372347 sequences. (Running on oeis4.)