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 A107294 #8 Mar 19 2023 09:08:30
%S A107294 1,1,1,1,1,1,3,1,1,3,7,1,3,1,1,1,1,1,1,1,1,1,1,1,1,1,5,3,1,1,1,1,1,1,
%T A107294 1,1,1,1,1,1,1,1,3,1,1,1,1,1,3,1,1,3,1,1,1,1,1,7,1,1,1,5,5,3,1,1,1,1,
%U A107294 1,1,1,1,1,1,1,1,1,5,3,1,1,1,1,1,1,1,1,5,1,1,1,1,5,9,1,1,1,1,1,1,1,1,1,1,1
%N A107294 GCD of (n + prime(n)) and (n + 1 + prime(n+1)).
%e A107294 a(139) = 13 because {(139 + prime(139)), (140 + prime(140))} = {936, 949} ={13*72,13*73}.
%t A107294 Table[GCD[n+Prime[n], n+1+Prime[n+1]], {n, 150}]
%t A107294 GCD@@#&/@Partition[Table[n+Prime[n],{n,150}],2,1] (* _Harvey P. Dale_, Mar 19 2023 *)
%Y A107294 Cf. A014688.
%K A107294 nonn
%O A107294 1,7
%A A107294 _Zak Seidov_, May 20 2005