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, 1, 1, 3, 3, 7, 7, 17, 15, 25, 37, 41, 63, 79, 105, 143, 185, 249, 329, 435, 579, 767, 1015, 1347, 1783, 2363, 3131, 4147, 5495, 7279, 9643, 12775, 16923, 22419, 29701, 39343, 52121, 69045, 91465, 121171, 160511, 212637, 281683, 373149, 494321, 654833, 867471
Offset: 1
Links
- Eli Jaffe, Table of n, a(n) for n = 1..1000
Programs
-
Python
from math import gcd def terms(n): nums = [1,1,1] for i in range(n-3): new_num = nums[i] + nums[i+1] + gcd(nums[i+1], nums[i+2]) nums.append(new_num) return nums
Comments