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 A058263 #16 Aug 26 2020 20:01:17
%S A058263 1,2,2,2,2,4,2,2,2,2,6,4,2,2,2,2,2,6,2,2,6,2,2,8,4,2,2,2,4,14,2,2,2,2,
%T A058263 2,6,6,2,2,2,2,10,2,4,2,6,6,2,2,4,2,2,10,2,2,2,2,6,4,2,2,2,2,2,4,2,6,
%U A058263 2,2,4,2,2,6,6,2,2,4,4,8,2,2,10,2,6,2,2,8,4,2,2,2,2,2,2,2,2,4,2,18,6,2,2
%N A058263 a(n) = gcd(prime(n) - 1, prime(n+1) - 1).
%H A058263 Michael De Vlieger, <a href="/A058263/b058263.txt">Table of n, a(n) for n = 1..10000</a>
%F A058263 a(n) = gcd(A006093(n), A006093(n+1)).
%e A058263 a(24) = gcd(89-1, 97-1) = gcd(88, 96) = 8.
%t A058263 Table[GCD[# - 1, NextPrime@ # - 1] &@ Prime@ n, {n, 102}] (* _Michael De Vlieger_, Dec 31 2016 *)
%t A058263 GCD[#[[1]],#[[2]]]&/@Partition[Prime[Range[110]]-1,2,1] (* _Harvey P. Dale_, Aug 26 2020 *)
%o A058263 (PARI) a(n) = gcd(prime(n)-1, prime(n+1)-1); \\ _Michel Marcus_, Dec 11 2013
%Y A058263 Cf. A006093.
%K A058263 nonn
%O A058263 1,2
%A A058263 _Labos Elemer_, Dec 06 2000
%E A058263 Offset corrected to 1 by _Michel Marcus_, Dec 11 2013