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-2 of 2 results.

A366988 The number of prime powers of prime numbers (A053810) that divide n.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 2, 1, 0, 2, 1, 0, 0, 0, 3, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 1, 0, 2, 0, 2, 0, 0, 0, 1, 0, 0, 1, 3, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0
Offset: 1

Views

Author

Amiram Eldar, Oct 31 2023

Keywords

Comments

a(n) depends only on the prime signature of n.
Every nonnegative number appears in the sequence of record values. k >= 1 first occurs at n = 2^prime(k) (A034785).

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := PrimePi[e]; a[1] = 0; a[n_] := Plus @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    a(n) = {my(f = factor(n)); sum(i = 1, #f~, primepi(f[i, 2]));}

Formula

Additive with a(p^e) = A000720(e).
a(n) = 0 if and only if n is squarefree (A005117).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{p prime} P(p) = 0.67167522222173297323..., where P(s) is the prime zeta function.

A366993 The largest divisor of n that is a term of A056166.

Original entry on oeis.org

1, 1, 1, 4, 1, 1, 1, 8, 9, 1, 1, 4, 1, 1, 1, 8, 1, 9, 1, 4, 1, 1, 1, 8, 25, 1, 27, 4, 1, 1, 1, 32, 1, 1, 1, 36, 1, 1, 1, 8, 1, 1, 1, 4, 9, 1, 1, 8, 49, 25, 1, 4, 1, 27, 1, 8, 1, 1, 1, 4, 1, 1, 9, 32, 1, 1, 1, 4, 1, 1, 1, 72, 1, 1, 25, 4, 1, 1, 1, 8, 27, 1, 1, 4
Offset: 1

Views

Author

Amiram Eldar, Oct 31 2023

Keywords

Comments

The number of these divisors is A095691(n) and their sum is A366990(n).

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := p^If[e == 1, 0, NextPrime[e+1, -1]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
  • PARI
    a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1]^precprime(f[i, 2]));}

Formula

Multiplicative with a(p) = 1 and a(p^e) = p^A007917(e).
a(n) <= n, with equality if and only if n is in A056166.
a(n) >= 1, with equality if and only if n is squarefree (A005117).
Showing 1-2 of 2 results.