A355899 The successive gcd's arising in A355898.

1, 1, 1, 1, 3, 1, 1, 3, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 5, 1, 1, 1, 1, 1, 11, 1, 3, 3, 3, 3, 3, 3, 1, 1, 3, 3, 1, 1, 1, 1, 1, 7, 17, 3, 1, 1, 3, 3, 3, 5, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 71, 71, 5, 1, 1, 5, 1, 3, 1, 13, 3, 1, 5, 15, 1, 1, 5

Offset: 1

Author

N. J. A. Sloane, Sep 03 2022

Keywords

• nonn

Comments

A proof that this does not grow too rapidly would prove that A355898 diverges.

Links

• Amiram Eldar, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A351871, A355898, A355900, A355901.

Programs

Mathematica

GCD @@@ Partition[Nest[Append[#1, #3 + Total[#2]/#3] & @@ {#1, #2, GCD @@ #2} & @@ {#, #[[-2 ;; -1]], GCD[#[[-2 ;; -1]]]} &, {1, 1}, 100], 2, 1] (* Michael De Vlieger, Sep 03 2022 *)