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 A370455 #15 Mar 02 2024 15:49:40
%S A370455 0,1,2,3,2,3,3,1,4,1,3,3,3,1,2,4,1,4,1,1,2,2,1,1,3,2,3,3,3,2,1,2,3,2,
%T A370455 2,1,2,1,2,2,3,1,2,4,1,3,1,3,7,1,2,2,2,3,2,4,1,3,1,2,1,3,3,3,1,2,2,1,
%U A370455 5,2,2,1,1,2,2,1,5,1,1,3,3,2,1,2,2,1
%N A370455 a(n) = greatest m such that 2^m divides prime(n+1)*prime(n+2) - prime(n)*prime(n+3).
%e A370455 prime(4)*prime(5) - prime(3)*prime(6) = 7*11 - 5*13 = 12, which is divisible by 2^2 but not 2^3, so a(3) = 2.
%t A370455 p[n_] := Prime[n];
%t A370455 u = Table[p[n + 1] p[n + 2] - p[n] p[n + 3], {n, 1, 2000}]; (* A117302 *)
%t A370455 s[n_] := Last[Select[Range[15], IntegerQ[u[[n]]/2^#] &]];
%t A370455 Table[s[n], {n, 1, 200}]
%o A370455 (PARI) a(n) = valuation(prime(n+1)*prime(n+2) - prime(n)*prime(n+3), 2); \\ _Michel Marcus_, Mar 01 2024
%o A370455 (Python)
%o A370455 from sympy import prime
%o A370455 def A370455(n): return (~(m:=prime(n+1)*prime(n+2)-prime(n)*prime(n+3)) & m-1).bit_length() # _Chai Wah Wu_, Mar 02 2024
%Y A370455 Cf. A007814, A117301.
%K A370455 nonn
%O A370455 1,3
%A A370455 _Clark Kimberling_, Feb 26 2024