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 A100375 #11 Feb 20 2022 16:48:22
%S A100375 1,1,1,1,1,1,1,1,3,1,3,1,1,1,3,3,1,3,1,1,3,1,3,1,1,1,1,1,1,7,1,3,1,5,
%T A100375 1,3,3,1,3,3,1,5,1,1,1,3,3,1,1,1,3,1,5,3,3,3,1,3,1,1,5,7,1,1,1,7,3,5,
%U A100375 1,1,3,1,3,3,1,3,1,1,1,5,1,5,1,3,1,3,1,1,1,1,3,1,1,1,1,3,3,1,9,3,5,3,3,1,3
%N A100375 a(n) is the n-th consecutive prime difference divided by the largest power of 2 which divides it.
%H A100375 Harvey P. Dale, <a href="/A100375/b100375.txt">Table of n, a(n) for n = 1..1000</a>
%F A100375 a(n) = A001223(n) / A006519(A001223(n)).
%t A100375 t1=Table[Prime[n+1]-Prime[n], {n, 1, 256}]; t2=Table[GCD[Prime[n+1]-Prime[n], 65536], {n, 1, 256}];t1/t2
%t A100375 #/2^IntegerExponent[#,2]&/@Differences[Prime[Range[110]]] (* _Harvey P. Dale_, Feb 20 2022 *)
%Y A100375 Cf. A006519, A001223, A100374.
%K A100375 nonn
%O A100375 1,9
%A A100375 _Labos Elemer_, Dec 03 2004