cp's OEIS Frontend

A358787 a(1)=1; let x=gcd(a(n-1),n); for n > 1, a(n) = a(n-1) + n if x=1 or a(n-1)/x=1, otherwise a(n) = a(n-1)/x.

%I A358787 #23 Dec 17 2022 08:21:51
%S A358787 1,3,6,3,8,4,11,19,28,14,25,37,50,25,5,21,38,19,38,19,40,20,43,67,92,
%T A358787 46,73,101,130,13,44,11,44,22,57,19,56,28,67,107,148,74,117,161,206,
%U A358787 103,150,25,74,37,88,22,75,25,5,61,118,59,118,59,120,60,20,5,70,35,102,3,72,36
%N A358787 a(1)=1; let x=gcd(a(n-1),n); for n > 1, a(n) = a(n-1) + n if x=1 or a(n-1)/x=1, otherwise a(n) = a(n-1)/x.
%H A358787 Michael De Vlieger, <a href="/A358787/a358787.png">Log log scatterplot of a(n)</a>, n = 1..2^20.
%H A358787 Michael De Vlieger, <a href="/A358787/a358787_1.png">Log log scatterplot of a(n)</a>, n = 1..2^16, with x = gcd(a(n-1), n), showing x=1 or a(n-1)/x = 1 in red, else dark blue.
%e A358787 For n=2, gcd(2,1)=1 so a(2) = 2+1 = 3.
%e A358787 For n=3, gcd(3,3)=3=a(2) so a(3) = 3+3 = 6.
%e A358787 For n=4, gcd(4,6)=2 so a(4) = 6/2 = 3.
%t A358787 nn = 2^16; a[1] = 1; Do[g = GCD[a[n - 1], n]; If[Or[g == 1, Set[k, a[n - 1]/g] == 1], a[n] = a[n - 1] + n, a[n] = k], {n, 2, nn}]; Array[a, nn] (* _Michael De Vlieger_, Dec 13 2022 *)
%o A358787 (Python)
%o A358787 from math import gcd
%o A358787 from itertools import count, islice
%o A358787 def agen(): # generator of terms
%o A358787     an = 1
%o A358787     for n in count(2):
%o A358787         yield an
%o A358787         x = gcd(an, n)
%o A358787         an = an + n if x == 1 or x == an else an//x
%o A358787 print(list(islice(agen(), 70))) # _Michael S. Branicky_, Dec 15 2022
%Y A358787 Cf. A264767, A133058, A133579, A133580, A255051, A255140, A262922.
%K A358787 nonn
%O A358787 1,2
%A A358787 _Gary Yane_, Nov 30 2022