cp's OEIS Frontend

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.

A350074 Difference between the maximal digit in the primorial base expansion of n and the maximal exponent in the prime factorization of n.

This page as a plain text file.
%I A350074 #14 Feb 03 2022 14:35:40
%S A350074 1,0,0,0,1,0,0,-2,-1,1,1,0,1,1,1,-2,1,1,2,1,2,2,2,1,2,3,1,2,3,0,0,-4,
%T A350074 0,1,1,-1,0,0,0,-1,1,1,1,0,0,1,1,-1,1,1,2,1,2,1,3,1,3,3,3,0,1,1,0,-4,
%U A350074 1,1,1,0,1,1,1,-1,1,1,0,0,1,2,2,-1,-1,2,2,2,3,3,3,1,3,1,2,1,2,2,2,-2,2,1,1,1,2,2,2,0,2
%N A350074 Difference between the maximal digit in the primorial base expansion of n and the maximal exponent in the prime factorization of n.
%H A350074 Antti Karttunen, <a href="/A350074/b350074.txt">Table of n, a(n) for n = 1..30030</a>
%H A350074 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A350074 a(n) = A328114(n) - A051903(n) = A051903(A276086(n)) - A051903(n).
%o A350074 (PARI)
%o A350074 A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
%o A350074 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A350074 A350074(n) = (A051903(A276086(n)) - A051903(n));
%Y A350074 Cf. A051903, A276086, A328114.
%Y A350074 Cf. A350075 (positions of negative terms), A350076 (of terms >= 0), A350070 (their characteristic function), A351038 (positions of terms <= 0), A351039 (their characteristic function).
%Y A350074 Cf. also A351074.
%K A350074 sign,base
%O A350074 1,8
%A A350074 _Antti Karttunen_, Feb 01 2022