This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A355899 #13 Sep 03 2022 14:04:11
%S A355899 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,
%T A355899 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,
%U A355899 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
%N A355899 The successive gcd's arising in A355898.
%C A355899 A proof that this does not grow too rapidly would prove that A355898 diverges.
%H A355899 Amiram Eldar, <a href="/A355899/b355899.txt">Table of n, a(n) for n = 1..10000</a>
%t A355899 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 *)
%Y A355899 Cf. A351871, A355898, A355900, A355901.
%K A355899 nonn
%O A355899 1,5
%A A355899 _N. J. A. Sloane_, Sep 03 2022