A363825 -id:A363825 - cp's OEIS frontend

A368979 The number of exponential divisors of n that are exponentially odd numbers (A268335).

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1

Offset: 1

Amiram Eldar, Jan 11 2024

First differs from A367516 at n = 128, and from A359411 at n = 512.

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

Cf. A001227, A008578, A049419, A138302, A268335, A322791, A368980.
Cf. A359411, A367516.
Similar sequences: A055076, A322483, A363825, A368977.

f[p_, e_] := DivisorSigma[0, e/2^IntegerExponent[e, 2]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = vecprod(apply(x -> numdiv(x >> valuation(x, 2)), factor(n)[, 2]));

Multiplicative with a(p^e) = A001227(e).
a(n) >= 1, with equality if and only if n is in A138302.
a(n) <= A049419(n), with equality if and only if n is noncomposite (A008578).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{p prime} (1 + Sum_{k>=2} (d(k) - d(k-1))/p^k) = 1.13657098749361390865..., where d(k) is the number of odd divisors of k (A001227).

A368977 The number of bi-unitary divisors of n that are exponentially odd numbers (A268335).

Original entry on oeis.org

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

Offset: 1

Amiram Eldar, Jan 11 2024

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

Cf. A000005, A005117, A062503, A222266, A268335, A286324, A368978.

Similar sequences: A055076, A322483, A363825, A368979.

f[p_, e_] := If[OddQ[e], (e+3)/2, 2*Floor[e/4]+1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

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

for(n=1, 100, print1(direuler(p=2, n, (1 + X - X^2 + 2*X^3 - X^4)/(1 - X - X^4 + X^5))[n], ", ")) \\ Vaclav Kotesovec, Jan 11 2024

Multiplicative with a(p^e) = (e+3)/2 if e is odd, and 2*floor(e/4)+1 if e is even.
a(n) >= 1, with equality if and only if n is in A062503.
a(n) <= A000005(n), with equality if and only if n is squarefree (A005117).
From Vaclav Kotesovec, Jan 11 2024: (Start)
Dirichlet g.f.: zeta(s)^2 * Product_{p prime} (1 - (1 - p^s + 2*p^(2*s)) / (p^s*(1 + p^s)*(1 + p^(2*s)))).
Let f(s) = Product_{p prime} (1 - (1 - p^s + 2*p^(2*s)) / (p^s*(1 + p^s)*(1 + p^(2*s)))).
Sum_{k=1..n} a(k) ~ f(1) * n * (log(n) + 2*gamma - 1 + f'(1)/f(1)), where
f(1) = Product_{p prime} (1 - (1 - p + 2*p^2) / (p*(1 + p)*(1 + p^2))) = 0.5715031234451924252215041182933420817059774181158824297150124265420835...,
f'(1) = f(1) * Sum_{p prime} (4*p^5 - p^4 + 2*p^3 + 2*p + 1) * log(p) / (p^7 + 2*p^6 + p^5 + 3*p^4 + p^3 + p - 1) = f(1) * 1.1422556395248477875508983912036578244050011522937179465478688905880430...
and gamma is the Euler-Mascheroni constant A001620. (End)

A382660 The unitary totient function applied to the exponentially odd numbers (A268335).

Original entry on oeis.org

1, 1, 2, 4, 2, 6, 7, 4, 10, 12, 6, 8, 16, 18, 12, 10, 22, 14, 12, 26, 28, 8, 30, 31, 20, 16, 24, 36, 18, 24, 28, 40, 12, 42, 22, 46, 32, 52, 26, 40, 42, 36, 28, 58, 60, 30, 48, 20, 66, 44, 24, 70, 72, 36, 60, 24, 78, 40, 82, 64, 42, 56, 70, 88, 72, 60, 46, 72

Offset: 1

Amiram Eldar, Apr 02 2025

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

Cf. A013662, A047994, A065463, A268335.

Similar sequences: A358346, A363825, A366438, A366439, A366534, A366535, A367417, A368711, A368979, A374456, A382661.

f[p_, e_] := p^e-1; uphi[1] = 1; uphi[n_] := Times @@ f @@@ FactorInteger[n]; expOddQ[n_] := AllTrue[FactorInteger[n][[;; , 2]], OddQ]; uphi /@ Select[Range[100], expOddQ]

uphi(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1]^f[i, 2]-1);}
isexpodd(n) = {my(f = factor(n)); for(i=1, #f~, if(!(f[i, 2] % 2), return (0))); 1;}
list(lim) = apply(uphi, select(isexpodd, vector(lim, i, i)));

a(n) = A047994(A268335(n)).

Sum_{k=1..n} a(k) ~ c * n^2, where c = (zeta(4)/(2*d^2)) * Product_{p prime} (1 - 2/p^2 + 2/p^3 - 2/p^4 + 1/p^5) = 0.504949539649594981601..., and d = A065463 is the asymptotic density of the exponentially odd numbers.

A382661 The unitary Jordan totient function applied to the exponentially odd numbers (A268335).

Original entry on oeis.org

1, 3, 8, 24, 24, 48, 63, 72, 120, 168, 144, 192, 288, 360, 384, 360, 528, 504, 504, 728, 840, 576, 960, 1023, 960, 864, 1152, 1368, 1080, 1344, 1512, 1680, 1152, 1848, 1584, 2208, 2304, 2808, 2184, 2880, 3024, 2880, 2520, 3480, 3720, 2880, 4032, 2880, 4488, 4224

Offset: 1

Amiram Eldar, Apr 02 2025

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

Cf. A013664, A065463, A191414, A268335.

Similar sequences: A358346, A363825, A366438, A366439, A366534, A366535, A367417, A368711, A368979, A374456, A382660.

f[p_, e_] := p^(2*e)-1; uj2[1] = 1; uj2[n_] := Times @@ f @@@ FactorInteger[n]; expOddQ[n_] := AllTrue[FactorInteger[n][[;; , 2]], OddQ]; uj2 /@ Select[Range[100], expOddQ]

uj2(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1]^(2*f[i, 2])-1);}
isexpodd(n) = {my(f = factor(n)); for(i=1, #f~, if(!(f[i, 2] % 2), return (0))); 1;}
list(lim) = apply(uj2, select(isexpodd, vector(lim, i, i)));

a(n) = A191414(A268335(n)).

Sum_{k=1..n} a(k) ~ c * n^3, where c = (zeta(6)/(3*d^3)) * Product_{p prime} (1 - 1/p^2 + 1/p^5 - 2/p^6 + 1/p^7) = 0.59726984314764530141..., and d = A065463 is the asymptotic density of the exponentially odd numbers.

A377141 Numbers whose cubes have more square divisors than the cube of any smaller number.

Original entry on oeis.org

1, 2, 4, 8, 12, 24, 36, 72, 144, 180, 360, 720, 900, 1800, 3600, 6300, 10800, 12600, 25200, 44100, 75600, 88200, 176400, 352800, 529200, 705600, 1411200, 1587600, 1940400, 3880800, 5821200, 7761600, 15523200, 17463600, 21344400, 42688800, 64033200, 85377600, 170755200

Offset: 1

Amiram Eldar, Oct 17 2024

nonn

Indices of records in A092520.

The corresponding record values are 1, 2, 4, 5, 8, 10, 16, 20, 28, 32, 40, 56, 64, 80, 112, 128, ... (see the link for more values).

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

Subsequence of A025487.

Cf. A092520.

f[p_, e_] := Floor[(3*e+2)/2]; d[1] = 1; d[n_] := Times @@ f @@@ FactorInteger[n]; With[{v = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {, }][[;; , 2]]}, seq = {}; dm = 0; Do[If[(dk = d[v[[k]]]) > dm, dm = dk; AppendTo[seq, v[[k]]]], {k, 1, Length[v]}]; seq]

A377710 Numbers that have a record number of infinitary divisors that are exponentially odd numbers (A268335).

Original entry on oeis.org

1, 2, 6, 24, 30, 120, 210, 840, 2310, 7560, 9240, 30030, 83160, 120120, 510510, 1081080, 1921920, 2042040, 9699690, 18378360, 32672640, 38798760, 223092870, 349188840, 620780160, 892371480, 5587021440, 6469693230, 8031343320, 14277943680, 25878772920, 128501493120

Offset: 1

Amiram Eldar, Nov 04 2024

nonn

First differs from A322484 at n = 15.
Indices of records in A363825.
The corresponding record values are 1, 2, 4, 6, 8, 12, 16, 24, 32, 36, 48, 64, 72, 96, ... (see the link for more values).

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

Cf. A268335, A363825, A322484.

Subsequence of A025487.

f[p_, e_] := 1 + If[OddQ[e], 2^DigitCount[e-1, 2, 1], 0]; d[1] = 1; d[n_] := Times @@ f @@@ FactorInteger[n]; v = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {, }][[;; , 2]]; seq = {}; dm = 0; Do[If[(dk = d[v[[k]]]) > dm, dm = dk; AppendTo[seq, v[[k]]]], {k, 1, Length[v]}]; seq

A377711 Numbers that have a record number of (1+phi)-divisors (A061389).

Original entry on oeis.org

1, 2, 6, 24, 30, 96, 120, 210, 480, 840, 1920, 2310, 3360, 9240, 13440, 30030, 36960, 120120, 147840, 332640, 480480, 1330560, 1921920, 4324320, 8168160, 17297280, 30750720, 32672640, 73513440, 155195040, 294053760, 522762240, 620780160, 1396755360, 2646483840

Offset: 1

Amiram Eldar, Nov 04 2024

nonn

Indices of records in A061389.

The corresponding record values are 1, 2, 4, 6, 8, 10, 12, 16, 20, 24, 28, 32, 40, 48, 56, ... (see the link for more values).

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

Cf. A061389, A307004.

Subsequence of A025487.

f[p_, e_] := EulerPhi[e] + 1; d[1] = 1; d[n_] := Times @@ f @@@ FactorInteger[n]; v = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {, }][[;; , 2]]; seq = {}; dm = 0; Do[If[(dk = d[v[[k]]]) > dm, dm = dk; AppendTo[seq, v[[k]]]], {k, 1, Length[v]}]; seq

cp's OEIS Frontend

A368979 The number of exponential divisors of n that are exponentially odd numbers (A268335).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A368977 The number of bi-unitary divisors of n that are exponentially odd numbers (A268335).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A382660 The unitary totient function applied to the exponentially odd numbers (A268335).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A382661 The unitary Jordan totient function applied to the exponentially odd numbers (A268335).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A377141 Numbers whose cubes have more square divisors than the cube of any smaller number.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A377710 Numbers that have a record number of infinitary divisors that are exponentially odd numbers (A268335).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A377711 Numbers that have a record number of (1+phi)-divisors (A061389).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica