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

A365401 The number of divisors of the largest unitary divisor of n that is a square.

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 5, 1, 3, 1, 3, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 5, 3, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 7, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 3, 3, 1, 1, 1, 5, 5, 1, 1, 3, 1, 1, 1
Offset: 1

Views

Author

Amiram Eldar, Sep 03 2023

Keywords

Comments

First differs from A212181 at n = 32.
The sum of these divisors is A351568(n).
All the terms are odd.

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := If[OddQ[e], 1, 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+1), factor(n)[, 2]));

Formula

a(n) = A000005(A350388(n)).
a(n) = A000005(n) / A365402(n).
a(n) <= A000005(n) with equality if and only if n is a square (A000290).
a(n) >= 1 with equality if and only if n is an exponentially odd number (A268335).
Multiplicative with a(p^e) = 1 if e is odd, and e+1 if e is even.
Dirichlet g.f.: zeta(2*s)^2 * Product_{p prime} (1 + 1/p^s + 1/p^(2*s) - 1/p^(3*s)).
From Vaclav Kotesovec, Sep 05 2023: (Start)
Dirichlet g.f.: zeta(s) * zeta(2*s)^2 * Product_{p prime} (1 - 2/p^(3*s) + 1/p^(4*s)).
Let f(s) = Product_{p prime} (1 - 2/p^(3*s) + 1/p^(4*s)).
Sum_{k=1..n} a(k) ~ f(1) * Pi^4 * n / 36 + sqrt(n) * zeta(1/2) * f(1/2)/2 * (log(n) + 4*gamma - 2 + zeta'(1/2)/zeta(1/2) + f'(1/2)/f(1/2)), where
f(1) = Product_{p prime} (1 - 2/p^3 + 1/p^4) = 0.7446954979060674204391238715944543281179691329049241118630718137015097502...,
f(1/2) = Product_{p prime} (1 - 2/p^(3/2) + 1/p^2) = 0.2312522106782016049013780988087017618011735848676872392115785564006277675...,
f'(1/2) = f(1/2) * Sum_{p prime} 2*(3*sqrt(p) - 2) * log(p) / (1 - 2*sqrt(p) + p^2) = f(1/2) * 6.937179176924511608542644054340717439502789953858512457656... and gamma is the Euler-Mascheroni constant A001620. (End)

A367170 The number of divisors of the largest unitary divisor of n that is a term of A138302.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 1, 3, 4, 2, 6, 2, 4, 4, 5, 2, 6, 2, 6, 4, 4, 2, 2, 3, 4, 1, 6, 2, 8, 2, 1, 4, 4, 4, 9, 2, 4, 4, 2, 2, 8, 2, 6, 6, 4, 2, 10, 3, 6, 4, 6, 2, 2, 4, 2, 4, 4, 2, 12, 2, 4, 6, 1, 4, 8, 2, 6, 4, 8, 2, 3, 2, 4, 6, 6, 4, 8, 2, 10, 5, 4, 2, 12, 4, 4
Offset: 1

Views

Author

Amiram Eldar, Nov 07 2023

Keywords

Crossrefs

Similar sequences: A365401, A365402.

Programs

  • Mathematica
    f[p_, e_] := If[e == 2^IntegerExponent[e, 2], 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~, if(f[i, 2] == 1 << valuation(f[i, 2], 2), f[i, 2] + 1, 1));}

Formula

Multiplicative with a(p^e) = A048298(e) + 1.
a(n) = A000005(A367168(n)).
a(n) <= A000005(n), with equality if and only if n is in A138302.

A380165 a(n) is the value of the Euler totient function when applied to the largest unitary divisor of n that is an exponentially odd number.

Original entry on oeis.org

1, 1, 2, 1, 4, 2, 6, 4, 1, 4, 10, 2, 12, 6, 8, 1, 16, 1, 18, 4, 12, 10, 22, 8, 1, 12, 18, 6, 28, 8, 30, 16, 20, 16, 24, 1, 36, 18, 24, 16, 40, 12, 42, 10, 4, 22, 46, 2, 1, 1, 32, 12, 52, 18, 40, 24, 36, 28, 58, 8, 60, 30, 6, 1, 48, 20, 66, 16, 44, 24, 70, 4, 72
Offset: 1

Views

Author

Amiram Eldar, Jan 14 2025

Keywords

Crossrefs

Programs

  • Mathematica
    f[p_, e_] := If[OddQ[e], (p-1)*p^(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~, if(f[i, 2] % 2, (f[i, 1]-1)*f[i, 1]^(f[i, 2]-1), 1));}

Formula

a(n) = A000010(A350389(n)).
a(n) >= 1, with equality if and only if n is either a square (A000290) or twice and odd square (A077591 \ {1}).
a(n) <= A000010(n), with equality if and only if n is an exponentially odd number (A268335).
Multiplicative with a(p^e) = (p-1)*p^(e-1) if e is odd, and 1 otherwise.
Dirichlet g.f.: zeta(2*s-2) * zeta(2*s) * Product_{p prime} (1 - 1/p^s + 1/p^(s-1) - 1/p^(2*s-2) - 1/p^(3*s-1) + 1/p^(3*s)).
Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = zeta(4) * Product_{p prime} (1 - 2/p^2 + 2/p^3 - 2/p^4 + 1/p^5) = 0.50115112192510092436... .
Showing 1-3 of 3 results.