login
A333716
a(0)=1; for n>0, a(n) is the greatest common divisor (GCD) of n and the sum of the previous terms back to the last GCD term, if the GCD is not already in the sequence; otherwise a(n) = a(n-1) + n.
1
1, 2, 4, 7, 11, 5, 11, 18, 26, 3, 13, 24, 36, 49, 63, 78, 94, 111, 129, 148, 168, 189, 211, 234, 258, 283, 309, 336, 364, 393, 423, 454, 486, 519, 553, 588, 624, 661, 699, 738, 778, 819, 861, 43, 87, 132, 178, 225, 273, 322, 10, 61, 113, 166, 220, 275, 331, 388, 446, 505, 565
OFFSET
0,2
COMMENTS
This sequence is similar to A337490 except that here when a GCD term is added to the sequence the sum of previous terms is reset to the value of that GCD. Subsequent terms calculate the sum of previous terms back to this last GCD value. See the examples below.
Unlike A337490 this sequence shows numerous drops in value as the sum used when calculating the GCD with n is constantly being reset back to a smaller value anytime a unique GCD value greater than 1 is found. In the first one million terms the sequence drops in value 1516 times, the largest drop occurring from a(738133) = 45463489818 to a(738134) = 738134.
EXAMPLE
a(4) = 11 as the sum of the previous terms is a(0)+...+a(3) = 14, and the GCD of 14 and 4 is 2. However 2 has already appeared so a(4) = a(3) + n = 7 + 4 = 11.
a(5) = 5 as the sum of all previous terms is a(0)+...+a(4) = 25, and the GCD of 25 and 5 is 5, and as 5 has not previously appeared a(5) = 5. As this term adds a GCD value to the sequence, the running sum of previous terms is now set to 5.
a(6) = 11 as the sum of previous terms is now just a(5) = 5, and as the GCD of 5 and 6 is 1, which already appears in the sequence, a(6) = a(5) + 6 = 5 + 6 = 11.
a(9) = 3 as the sum of previous terms back to the last GCD term is a(5)+...+a(8) = 60, and the GCD of 60 and 9 is 3, and as 3 has not previously appeared, a(9) = 3. As this term adds a GCD value to the sequence, the running sum of previous terms is now set to 3.
MATHEMATICA
Block[{k = 0}, Nest[Append[#, If[FreeQ[#1, #3], Set[k, #2]; #3, #1[[-1]] + #2]] & @@ {#1, #2, GCD[Total@ #1[[k + 1 ;; #2]], #2]} & @@ {#, Length@ #} &, {1}, 60]] (* Michael De Vlieger, Sep 20 2020 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Scott R. Shannon, Sep 03 2020
STATUS
approved