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.

A349025 a(n) is multiplicative with a(p^e) = Sum_{d||e} p^(e-d), where d||e are the unitary divisors of e.

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 1, 5, 4, 1, 1, 3, 1, 1, 1, 9, 1, 4, 1, 3, 1, 1, 1, 5, 6, 1, 10, 3, 1, 1, 1, 17, 1, 1, 1, 12, 1, 1, 1, 5, 1, 1, 1, 3, 4, 1, 1, 9, 8, 6, 1, 3, 1, 10, 1, 5, 1, 1, 1, 3, 1, 1, 4, 57, 1, 1, 1, 3, 1, 1, 1, 20, 1, 1, 6, 3, 1, 1, 1, 9, 28, 1, 1, 3, 1
Offset: 1

Views

Author

Amiram Eldar, Nov 06 2021

Keywords

Comments

First differs from A348963 at n = 16.
A number k is an exponential unitary harmonic number (A349026) if and only if a(k) | k * A278908(k).

Crossrefs

The unitary version of A348963.

Programs

  • Mathematica
    f[p_, e_] := DivisorSum[e, p^(e - #) &, CoprimeQ[#, e/#] &]; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

Formula

a(n) = 1 if and only if n is squarefree (A005117).