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.

Showing 1-1 of 1 results.

A370080 The product of the even exponents of the prime factorization of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 4, 4, 1, 1, 2, 1, 1, 1
Offset: 1

Views

Author

Amiram Eldar, Feb 09 2024

Keywords

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := If[EvenQ[e], e, 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    a(n) = vecprod(apply(x -> if(x%2, 1, x), factor(n)[, 2]));

Formula

a(n) = A005361(A350388(n)).
Multiplicative with a(p^e) = e if e is even, and 1 if e is odd.
a(n) = A005361(n)/A370079(n).
a(n) >= 1, with equality if and only if n is an exponentially odd number (A268335).
a(n) <= A005361(n), with equality if and only if n is in A335275.
Dirichlet g.f.: zeta(2*s)^2 * Product_{p prime} (1 + 1/p^s - 1/p^(3*s) + 1/p^(4*s)).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = zeta(2)^2 * Product_{p prime} (1 - 1/p^2 - 1/p^3 + 2/p^4 - 1/p^5) = 1.53318063378623623841... .
Dirichlet g.f.: zeta(s) * Product_{p prime} (1 + (p^(2*s) + 1)/(p^s*(p^s - 1)*(p^s + 1)^2)). - Vaclav Kotesovec, Feb 11 2024
Showing 1-1 of 1 results.