login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A329619 Difference between the maximal digit value used when A108951(n) is written in primorial base and its 2-adic valuation. 6
1, 0, 0, 0, 0, 0, 0, -2, -1, 0, 0, 1, 0, 0, 4, -2, 0, -1, 0, 1, 4, 0, 0, -1, 2, 0, -2, 1, 0, 2, 0, -4, 4, 0, 6, 0, 0, 0, 4, -3, 0, -2, 0, 1, 2, 0, 0, -2, 4, 5, 4, 1, 0, -2, 2, 4, 4, 0, 0, -1, 0, 0, 0, -4, 11, 9, 0, 1, 4, 2, 0, -2, 0, 0, 2, 1, 14, 9, 0, -3, 2, 0, 0, -2, 9, 0, 4, 4, 0, 6, 10, 1, 4, 0, 5, 0, 0, 9, 7, 2, 0, 9, 0, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
FORMULA
a(n) = A329344(n) - A001222(n).
a(n) = A328114(A108951(n)) - A007814(A108951(n)).
a(p) = 0 for all primes p.
MATHEMATICA
With[{b = Reverse@ Prime@ Range@ 120}, Array[Max@ IntegerDigits[#, MixedRadix[b]] &@ Apply[Times, Map[#1^#2 & @@ # &, FactorInteger[#] /. {p_, e_} /; e > 0 :> {Times @@ Prime@ Range@ PrimePi@ p, e}]] - PrimeOmega[#] &, 105] ] (* Michael De Vlieger, Nov 18 2019 *)
PROG
(PARI)
A034386(n) = prod(i=1, primepi(n), prime(i));
A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) }; \\ From A108951
A328114(n) = { my(s=0, p=2); while(n, s = max(s, (n%p)); n = n\p; p = nextprime(1+p)); (s); };
A329619(n) = (A329344(n) - bigomega(n));
CROSSREFS
Sequence in context: A140728 A254110 A331289 * A298426 A130068 A316825
KEYWORD
sign
AUTHOR
Antti Karttunen, Nov 18 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 30 08:10 EDT 2024. Contains 373861 sequences. (Running on oeis4.)