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 A351097 #12 Feb 04 2022 22:36:48
%S A351097 0,0,0,0,0,1,0,-1,-1,0,0,0,0,0,0,-3,0,1,0,2,1,1,0,-1,0,1,1,-1,0,0,0,
%T A351097 -2,1,2,1,0,0,2,1,-1,0,1,0,1,-1,3,0,-1,0,0,2,2,0,0,1,0,2,0,0,1,0,0,1,
%U A351097 0,2,1,0,0,3,3,0,2,0,0,2,1,2,1,0,1,-1,1,0,2,2,1,0,1,0,2,2,1,1,2,3,-3,0,0,0,2,0,2,0,2,1
%N A351097 Difference between {the maximal digit value in primorial base expansion of the arithmetic derivative of n} and {the maximal exponent in the prime factorization of n}.
%H A351097 Antti Karttunen, <a href="/A351097/b351097.txt">Table of n, a(n) for n = 1..30030</a>
%F A351097 a(n) = A328390(n) - A051903(n) = A051903(A327859(n)) - A051903(n).
%o A351097 (PARI)
%o A351097 A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
%o A351097 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A351097 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A351097 A327859(n) = A276086(A003415(n));
%o A351097 A351097(n) = (A051903(A327859(n)) - A051903(n));
%Y A351097 Cf. A003415, A051903, A276086, A327859, A328390, A351098 (positions of negative terms), A351099.
%Y A351097 Cf. also A350074, A351074.
%K A351097 sign
%O A351097 1,16
%A A351097 _Antti Karttunen_, Feb 03 2022