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

%I #24 Mar 01 2024 15:55:19

%S 1,1,1,3,3,7,7,17,15,25,37,41,63,79,105,143,185,249,329,435,579,767,

%T 1015,1347,1783,2363,3131,4147,5495,7279,9643,12775,16923,22419,29701,

%U 39343,52121,69045,91465,121171,160511,212637,281683,373149,494321,654833,867471

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

%C The ratio between consecutive terms (a(n)/a(n-1)) appears to approach the plastic constant A060006.

%H Eli Jaffe, <a href="/A370202/b370202.txt">Table of n, a(n) for n = 1..1000</a>

%o (Python)

%o from math import gcd

%o def terms(n):

%o nums = [1,1,1]

%o for i in range(n-3):

%o new_num = nums[i] + nums[i+1] + gcd(nums[i+1], nums[i+2])

%o nums.append(new_num)

%o return nums

%Y Cf. A060006, A083658.

%K nonn,easy

%O 1,4

%A _Eli Jaffe_, Feb 11 2024

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 July 14 02:13 EDT 2024. Contains 374290 sequences. (Running on oeis4.)