A053166 -id:A053166 - cp's OEIS frontend

A365491 The number of divisors of the smallest number whose 4th power is divisible by n.

1, 2, 2, 2, 2, 4, 2, 2, 2, 4, 2, 4, 2, 4, 4, 2, 2, 4, 2, 4, 4, 4, 2, 4, 2, 4, 2, 4, 2, 8, 2, 3, 4, 4, 4, 4, 2, 4, 4, 4, 2, 8, 2, 4, 4, 4, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 2, 8, 2, 4, 4, 3, 4, 8, 2, 4, 4, 8, 2, 4, 2, 4, 4, 4, 4, 8, 2, 4, 2, 4, 2, 8, 4, 4, 4

Offset: 1

Amiram Eldar, Sep 05 2023

First differs from A365210 at n = 25 and from A034444 at n = 32.

The number of divisors of the smallest 4th divisible by n, A053167(n), is A365492(n).

Amiram Eldar, Table of n, a(n) for n = 1..10000
Vaclav Kotesovec, Graph - the asymptotic ratio (100000 terms).

Cf. A000005, A001620, A005117, A053166, A053167, A365492, A365499.

Cf. A019554, A034444, A322483, A365210.

f[p_, e_] := Ceiling[e/4] + 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
With[{c=Range[100]^4},Table[DivisorSigma[0,Surd[SelectFirst[c,Mod[#,n]==0&],4]],{n,90}]] (* Harvey P. Dale, Jul 09 2024 *)

a(n) = vecprod(apply(x -> (x-1)\4 + 2, factor(n)[, 2]));

a(n) = A000005(A053166(n)).
Multiplicative with a(p^e) = ceiling(e/4) + 1.
a(n) <= A000005(n) with equality if and only if n is squarefree (A005117).
Dirichlet g.f.: zeta(s) * zeta(4*s) * Product_{p prime} (1 + 1/p^s - 1/p^(4*s)).
From Vaclav Kotesovec, Sep 06 2023: (Start)
Dirichlet g.f.: zeta(s)^2 * zeta(4*s) * Product_{p prime} (1 - 1/p^(2*s) - 1/p^(4*s) + 1/p^(5*s)).
Let f(s) = Product_{p prime} (1 - 1/p^(2*s) - 1/p^(4*s) + 1/p^(5*s)).
Sum_{k=1..n} a(k) ~ zeta(4) * f(1) * n * (log(n) + 2*gamma - 1 + 4*zeta'(4)/zeta(4) + f'(1)/f(1)), where
f(1) = Product_{p prime} (1 - 1/p^2 - 1/p^4 + 1/p^5) = 0.57615273538566705952061107826411727540624711680289618854325028459572487...,
f'(1) = f(1) * Sum_{p prime} (-5 + 4*p + 2*p^3) * log(p) / (1 - p - p^3 + p^5) = f(1) * 1.3011434396559802378314782600747661399223385669839998680418996210...
and gamma is the Euler-Mascheroni constant A001620. (End)
a(n) = A322483(A019554(n)) (the number of exponentially odd divisors of the smallest number whose square is divisible by n). - Amiram Eldar, Sep 08 2023

A062379 n divided by largest 4th-power-free factor of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Henry Bottomley, Jun 18 2001

Antti Karttunen, Table of n, a(n) for n = 1..10000
Henry Bottomley, Some Smarandache-type multiplicative sequences.

Cf. A000190, A000583, A008835, A053164, A053165, A053166, A053167, A056553, A056554, A056555, A058035. See A003557 for squares and A062378 for cubes.

f[p_, e_] := p^Max[e-3, 0]; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Sep 07 2020 *)

(define (A062379 n) (/ n (A058035 n)))
(define (A058035 n) (if (= 1 n) n (* (expt (A020639 n) (min 3 (A067029 n))) (A058035 (A028234 n)))))
;; Antti Karttunen, Sep 13 2017

a(n) = n/A058035(n).

Multiplicative with a(p^e) = p^max(e-3, 0). - Amiram Eldar, Sep 07 2020

A365492 The number of divisors of the smallest 4th power divisible by n.

Original entry on oeis.org

1, 5, 5, 5, 5, 25, 5, 5, 5, 25, 5, 25, 5, 25, 25, 5, 5, 25, 5, 25, 25, 25, 5, 25, 5, 25, 5, 25, 5, 125, 5, 9, 25, 25, 25, 25, 5, 25, 25, 25, 5, 125, 5, 25, 25, 25, 5, 25, 5, 25, 25, 25, 5, 25, 25, 25, 25, 25, 5, 125, 5, 25, 25, 9, 25, 125, 5, 25, 25, 125, 5, 25

Offset: 1

Amiram Eldar, Sep 05 2023

First differs from A082476 at n = 32.

The number of divisors of the 4th root of the smallest 4th power divisible by n, A053166(n), is A365491(n).

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000005, A053166, A053167, A082476, A365491.

f[p_, e_] := 4*Ceiling[e/4] + 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = vecprod(apply(x -> 4*((x-1)\4) + 5, factor(n)[, 2]));

a(n) = A000005(A053167(n)).
Multiplicative with a(p^e) = 4*ceiling(e/4) + 1.
Dirichlet g.f.: zeta(s) * zeta(4*s) * Product_{p prime} (1 + 4/p^s - 1/p^(4*s)).

A088835 a(n) = lcm(A020639(n), A006530(n)).

Original entry on oeis.org

1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 6, 13, 14, 15, 2, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 10, 31, 2, 33, 34, 35, 6, 37, 38, 39, 10, 41, 14, 43, 22, 15, 46, 47, 6, 7, 10, 51, 26, 53, 6, 55, 14, 57, 58, 59, 10, 61, 62, 21, 2, 65, 22, 67, 34, 69, 14, 71, 6, 73, 74, 15, 38, 77

Offset: 1

Labos Elemer, Oct 31 2003

nonn

Enrique Pérez Herrero, Table of n, a(n) for n = 1..10000

Cf. A020639, A006530, A066048, A007947, A062953, A015052, A015053, A053166, A097448.

Map[LCM[#[[1,1]], #[[-1,1]]] &, FactorInteger[Range[100]]] (* Paolo Xausa, Mar 29 2024 *)

a(n) = if (n==1, 1, my(f=factor(n)[,1]~); lcm(vecmin(f), vecmax(f))); \\ Michel Marcus, Mar 15 2018

a(n) = A097448(A066048(n)). - Amiram Eldar, Mar 16 2025

cp's OEIS Frontend

A365491 The number of divisors of the smallest number whose 4th power is divisible by n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A062379 n divided by largest 4th-power-free factor of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

A365492 The number of divisors of the smallest 4th power divisible by n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A088835 a(n) = lcm(A020639(n), A006530(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula