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 A351074 #9 Feb 03 2022 16:44:10
%S A351074 0,-1,0,-1,0,-1,0,0,-1,0,0,-1,1,0,0,0,0,0,1,0,1,1,1,0,1,2,0,1,2,-1,1,
%T A351074 -4,0,0,0,0,0,0,0,-2,0,0,0,0,0,0,0,-2,0,0,1,0,1,0,2,0,2,2,2,-1,0,0,-1,
%U A351074 -4,0,0,0,-1,0,1,0,0,0,0,-1,-1,0,1,1,3,-2,1,1,1,2,2,2,0,2,0,1,2,1,1,1,-3,1,0,0,1,1,1,1,-1,1
%N A351074 Difference between the maximal exponent in the prime factorization of A327860(n) and the maximal exponent in the prime factorization of n.
%H A351074 Antti Karttunen, <a href="/A351074/b351074.txt">Table of n, a(n) for n = 1..30030</a>
%H A351074 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A351074 a(n) = A328391(n) - A051903(n) = A051903(A327860(n)) - A051903(n).
%o A351074 (PARI)
%o A351074 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A351074 A327860(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= (p^e); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); };
%o A351074 A351074(n) = (A051903(A327860(n)) - A051903(n));
%Y A351074 Cf. A051903, A276086, A327860, A328114, A328391.
%Y A351074 Cf. A351075 (positions of negative terms), A351076 (of terms >= 0), A351077 (their characteristic function).
%Y A351074 Cf. also A350074.
%K A351074 sign,base
%O A351074 1,26
%A A351074 _Antti Karttunen_, Feb 01 2022