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!)
A308469 a(1) = 1, a(2)=2, a(n) = a(n-1) + gcd(a(n-2), n-2). 0

%I #14 Sep 09 2019 07:49:36

%S 1,2,3,5,8,9,10,13,14,15,16,21,22,25,26,27,28,29,30,31,32,33,34,45,46,

%T 49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,93,

%U 94,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113

%N a(1) = 1, a(2)=2, a(n) = a(n-1) + gcd(a(n-2), n-2).

%C Apparently, the distinct values of a(n)-n for n > 7 correspond to A190894. - _Rémy Sigrist_, Jul 23 2019

%t a[1] = 1; a[2] = 2; a[n_] := a[n] = a[n-1] + GCD[a[n-2], n-2]; Array[a, 70] (* _Amiram Eldar_, Aug 01 2019 *)

%Y Cf. A106108, A190894.

%K nonn

%O 1,2

%A _Thomas Kerscher_, May 29 2019

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 August 12 01:38 EDT 2024. Contains 375082 sequences. (Running on oeis4.)