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 A057467 #13 Mar 21 2020 09:40:27 %S A057467 1,2,2,2,2,2,2,2,2,2,2,2,2,2,6,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,2,2,2, %T A057467 2,6,2,2,6,2,2,2,2,2,2,12,4,2,2,2,2,2,2,6,6,2,2,2,2,2,2,2,2,2,2,2,2,2, %U A057467 2,2,2,2,6,2,2,2,4,4,2,2,2,2,2,2,2,2,4,2,2,4,4,4,4,4,2,6,2,2,6,2,2,6,2,2 %N A057467 GCD of n-th and (n+1)-st term in the sequence of first differences between primes, A001223. %F A057467 a(n) = gcd( A001223(n+1), A001223(n) ). %t A057467 Map[GCD @@ # &, Partition[#, 2, 1] &@ Differences@ Prime@ Range@ 100] (* _Michael De Vlieger_, Feb 18 2017 *) %Y A057467 Cf. A001223. %K A057467 nonn,easy %O A057467 1,2 %A A057467 _Labos Elemer_, Dec 06 2000