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 A076920 #10 Oct 25 2023 08:47:32
%S A076920 1,2,4,2,5,3,2,4,2,13,3,2,4,2,5,11,2,4,2,37,3,2,4,2,61,3,2,4,2,97,3,2,
%T A076920 4,2,151,3,2,229,3,2,4,2,349,3,2,4,2,23,47,2,5,227,2,4,2,5,11,2,4,2,
%U A076920 17,83,2,4,2,751,3,2,1129,3,2,4,2,1699,3,2,2551,3,2,7
%N A076920 Highest common factor of a pair of successive terms of A076919.
%p A076920 A076920 := proc(nmax) local a,b,k; a := [1,2] ; b := [1] ; while nops(b) < nmax do k := op(-1,a)+1 ; while gcd(k,op(-1,a)) <= 1 or gcd(k,op(-1,a)) = gcd(op(-1,a),op(-2,a)) do k := k+1 ; od ; b := [op(b),gcd(k,op(-1,a))] ; a := [op(a),k] ; od ; RETURN(b) ; end: A076920(80) ; # _R. J. Mathar_, Jul 01 2007
%t A076920 f[1] = 1; f[2] = 2; (* f is A076919 *)
%t A076920 f[n_] := f[n] = Module[{k}, For[k = f[n-1] + 1, True, k++, If[GCD[f[n-1], f[n-2]] != GCD[k, f[n-1]] && GCD[k, f[n-1]] > 1, Return[k]]]];
%t A076920 GCD @@@ Partition[Table[f[n], {n, 1, 81}], 2, 1] (* _Jean-François Alcover_, Oct 25 2023 *)
%Y A076920 Cf. A076919.
%K A076920 nonn
%O A076920 1,2
%A A076920 _Amarnath Murthy_, Oct 17 2002
%E A076920 More terms from _R. J. Mathar_, Jul 01 2007