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!)
A336065 Decimal expansion of the asymptotic density of the numbers divisible by the maximal exponent in their prime factorization (A336064). 2
8, 4, 8, 9, 5, 7, 1, 9, 5, 0, 0, 4, 4, 9, 3, 3, 2, 8, 1, 4, 2, 7, 1, 0, 9, 7, 6, 8, 5, 4, 4, 3, 5, 2, 9, 2, 6, 7, 7, 9, 1, 4, 7, 2, 8, 9, 9, 4, 9, 1, 8, 1, 0, 0, 9, 7, 8, 8, 1, 7, 6, 4, 4, 2, 0, 5, 6, 1, 5, 7, 0, 9, 6, 6, 9, 2, 4, 6, 7, 0, 3, 0, 0, 1, 5, 8, 6 (list; constant; graph; refs; listen; history; text; internal format)
OFFSET
0,1
REFERENCES
József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, chapter 3, p. 331.
LINKS
Andrzej Schinzel and Tibor Šalát, Remarks on maximum and minimum exponents in factoring, Mathematica Slovaca, Vol. 44, No. 5 (1994), pp. 505-514.
FORMULA
Equals 1/zeta(2) + Sum_{k>=2} ((1/zeta(k+1)) * Product_{p prime, p|k} ((p^(k-e(p,k)+1) - 1)/(p^(k+1) - 1)) - (1/zeta(k)) * Product_{p prime, p|k} ((p^(k-e(p,k)) - 1)/(p^k - 1))), where e(p,k) is the largest exponent of p dividing k.
EXAMPLE
0.848957195004493328142710976854435292677914728994918...
MATHEMATICA
f[k_] := Module[{f = FactorInteger[k]}, p = f[[;; , 1]]; e = f[[;; , 2]]; (1/Zeta[k + 1])* Times @@ ((p^(k - e + 1) - 1)/(p^(k + 1) - 1)) - (1/Zeta[k]) * Times @@ ((p^(k - e) - 1)/(p^k - 1))]; RealDigits[1/Zeta[2] + Sum[f[k], {k, 2, 1000}], 10, 100][[1]]
CROSSREFS
Sequence in context: A087015 A200224 A345929 * A124012 A335354 A000803
KEYWORD
nonn,cons
AUTHOR
Amiram Eldar, Jul 07 2020
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 April 19 04:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)