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!)
A116538 a(1)=1, a(2)=2; a(n) is the smallest positive integer not occurring earlier in the sequence such that gcd(a(n-2), a(n-1)+a(n)) = 1. 1

%I #12 Oct 26 2019 18:03:02

%S 1,2,3,4,6,5,8,9,10,7,12,11,14,13,16,15,18,19,22,17,20,21,26,24,23,30,

%T 25,28,29,32,27,34,31,36,33,38,35,40,39,42,37,46,41,44,43,48,45,50,47,

%U 52,49,54,53,56,51,58,55,60,57,62,59,64,61,66,63,68,69,70,67,72,65,74

%N a(1)=1, a(2)=2; a(n) is the smallest positive integer not occurring earlier in the sequence such that gcd(a(n-2), a(n-1)+a(n)) = 1.

%C Sequence may be a permutation of the positive integers.

%H Diana Mecum, <a href="/A116538/b116538.txt">Table of n, a(n) for n = 1..1132</a>

%e Among the positive integers not occurring among the first 6 terms of the sequence, 8 is the smallest m such that gcd(a(5), a(6)+m) = gcd(6,5+m) = 1.

%e Had we used 7 for m instead, we would have had gcd(6,5+7) = 6. So a(7) = 8.

%K nonn

%O 1,2

%A _Leroy Quet_, Mar 27 2006

%E More terms from _Diana L. Mecum_, Jun 21 2007

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 April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)