A351569 -id:A351569 - cp's OEIS frontend

A377991 Numbers k such that A351568(k) and A351569(k) are not coprime, where A351568 and A351569 are the sum of divisors of the largest unitary divisor of n that is a square, and of the largest unitary divisor of n that is an exponentially odd number, respectively.

52, 98, 156, 164, 245, 260, 294, 332, 338, 364, 388, 392, 468, 490, 492, 539, 556, 572, 668, 722, 724, 735, 780, 820, 833, 845, 882, 884, 892, 927, 972, 976, 980, 988, 996, 1004, 1014, 1078, 1092, 1125, 1127, 1148, 1164, 1172, 1176, 1196, 1228, 1274, 1300, 1352, 1396, 1404, 1421, 1470, 1476, 1508, 1525, 1568, 1573

Offset: 1

Antti Karttunen, Nov 15 2024

nonn

			A351568(52) = 7 and A351569(52) = 14, so they share a factor (7), and therefore 52 is included as a term.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences related to sigma(n)

Positions k where A377990(k) is larger than A051027(k).
Cf. A350388, A350389, A351568, A351569.
Subsequence of A336548.

A350388(n) = { my(m=1, f=factor(n)); for(k=1,#f~,if(0==(f[k,2]%2), m *= (f[k,1]^f[k,2]))); (m); };
A351568(n) = sigma(A350388(n));
isA377991(n) = (1A351568(n), sigma(n)/A351568(n)));

{k such that gcd(A351568(n),A351569(n)) > 1}.

{k such that A377990(k) > A051027(k)}.

A374485 Lexicographically earliest infinite sequence such that a(i) = a(j) => A350388(i) = A350388(j) and A351569(i) = A351569(j), for all i, j >= 1.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 6, 11, 12, 13, 13, 14, 10, 15, 16, 17, 18, 19, 13, 20, 21, 22, 23, 24, 25, 26, 18, 27, 28, 29, 28, 30, 31, 20, 32, 33, 22, 34, 35, 36, 37, 26, 28, 38, 39, 40, 26, 41, 29, 42, 26, 42, 43, 33, 20, 44, 45, 34, 46, 47, 48, 49, 50, 51, 34, 49, 26, 52, 53, 54, 55, 56, 34, 57, 43, 58, 59, 60, 48, 61, 62, 63, 42, 64, 33, 65, 66, 44, 67, 49, 42, 68

Offset: 1

Antti Karttunen, Aug 06 2024

nonn

Restricted growth sequence transform of the ordered pair [A350388(n), A351569(n)].

For all i, j >= 1: a(i) = a(j) => A000203(i) = A000203(j).

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences related to sigma(n)

Cf. A000203, A350388, A350389, A351569.

Cf. also A286603, A291751.

up_to = 65537;
rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
A350388(n) = { my(m=1, f=factor(n)); for(k=1,#f~,if(0==(f[k,2]%2), m *= (f[k,1]^f[k,2]))); (m); };
A350389(n) = { my(m=1, f=factor(n)); for(k=1,#f~,if(1==(f[k,2]%2), m *= (f[k,1]^f[k,2]))); (m); };
A351569(n) = sigma(A350389(n));
Aux374485(n) = [A350388(n), A351569(n)];
v374485 = rgs_transform(vector(up_to, n, Aux374485(n)));
A374485(n) = v374485[n];

A342925 a(n) = A003415(sigma(n)), where A003415 is the arithmetic derivative, and sigma is the sum of divisors of n.

Original entry on oeis.org

0, 1, 4, 1, 5, 16, 12, 8, 1, 21, 16, 32, 9, 44, 44, 1, 21, 16, 24, 41, 80, 60, 44, 92, 1, 41, 68, 92, 31, 156, 80, 51, 112, 81, 112, 20, 21, 92, 92, 123, 41, 272, 48, 124, 71, 156, 112, 128, 22, 34, 156, 77, 81, 244, 156, 244, 176, 123, 92, 332, 33, 272, 164, 1, 124, 384, 72, 165, 272, 384, 156, 119, 39, 101, 128, 188

Offset: 1

Antti Karttunen, Apr 07 2021

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A023194 (positions of ones, which is a subsequence of prime powers, A000961).
Cf. A342922, A342923, A342924, A342926, A351568, A351569, A351570, A351571.
Cf. A342021 (fixed points), A343216 [positions k where a(k) < k], A343217 [a(k) >= k], A343218 [a(k) > k].
Cf. A347870 (parity of terms), A347872, A347873, A347877 (positions of odd terms), A347878 (of even terms), A343218, A343220, A344024.

Array[If[# < 2, 0, # Total[#2/#1 & @@@ FactorInteger[#]]] &@ DivisorSigma[1, #] &, 76] (* Michael De Vlieger, Apr 08 2021 *)

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A342925(n) = A003415(sigma(n));

a(A023194(n)) = 1.
If gcd(m,n) = 1, a(m*n) = sigma(m)*A003415(sigma(n)) + sigma(n)*A003415(sigma(m)) = sigma(m)*a(n) + sigma(n)*a(m).
a(n) = (A351568(n)*A351571(n)) + (A351569(n)*A351570(n)). - Antti Karttunen, Feb 23 2022

A351568 Sum of the divisors of the largest unitary divisor of n that is a square.

Original entry on oeis.org

1, 1, 1, 7, 1, 1, 1, 1, 13, 1, 1, 7, 1, 1, 1, 31, 1, 13, 1, 7, 1, 1, 1, 1, 31, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 91, 1, 1, 1, 1, 1, 1, 1, 7, 13, 1, 1, 31, 57, 31, 1, 7, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 13, 127, 1, 1, 1, 7, 1, 1, 1, 13, 1, 1, 31, 7, 1, 1, 1, 31, 121, 1, 1, 7, 1, 1, 1, 1, 1, 13, 1, 7, 1, 1, 1, 1, 1, 57, 13

Offset: 1

Antti Karttunen, Feb 23 2022

Obviously, all terms are odd.

Antti Karttunen, Table of n, a(n) for n = 1..65537
Index entries for sequences related to sigma(n).

Cf. A000203, A002117, A350388, A351569, A351570, A351575 (positions of primes).

f[p_, e_] := If[EvenQ[e], (p^(e + 1) - 1)/(p - 1), 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Feb 23 2022 *)

A350388(n) = { my(m=1, f=factor(n)); for(k=1,#f~,if(0==(f[k,2]%2), m *= (f[k,1]^f[k,2]))); (m); };
A351568(n) = sigma(A350388(n));

from math import prod
from sympy import factorint
def A351568(n): return prod(1 if e % 2 else (p**(e+1)-1)//(p-1) for p, e in factorint(n).items()) # Chai Wah Wu, Feb 24 2022

Multiplicative with a(p^e) = (p^(e+1)-1)/(p-1) if e is even and 1 otherwise.
a(n) = A000203(A350388(n)).
a(n) = A000203(n) / A351569(n).
Sum_{k=1..n} a(k) ~ c * n^(3/2), where c = (zeta(3)/3) * Product_{p prime} (1 + 1/p^(3/2) + 1/p^2 - 1/p^(5/2)) = 1.008259499413... . - Amiram Eldar, Nov 20 2022
Dirichlet g.f.: zeta(2*s) * zeta(2*s-2) * Product_{p prime} (1 + 1/p^s + 1/p^(2*s-1) - 1/p^(3*s-2)). - Amiram Eldar, Sep 03 2023

A358346 a(n) is the sum of the unitary divisors of n that are exponentially odd (A268335).

Original entry on oeis.org

1, 3, 4, 1, 6, 12, 8, 9, 1, 18, 12, 4, 14, 24, 24, 1, 18, 3, 20, 6, 32, 36, 24, 36, 1, 42, 28, 8, 30, 72, 32, 33, 48, 54, 48, 1, 38, 60, 56, 54, 42, 96, 44, 12, 6, 72, 48, 4, 1, 3, 72, 14, 54, 84, 72, 72, 80, 90, 60, 24, 62, 96, 8, 1, 84, 144, 68, 18, 96, 144

Offset: 1

Amiram Eldar, Nov 11 2022

The number of unitary divisors of n that are exponentially odd is A055076(n).

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

Cf. A000290, A005117, A055076, A077610, A268335, A351569.

Similar sequences: A033634, A034448, A035316, A358347.

f[p_, e_] := 1 + If[OddQ[e], p^e, 0]; a[n_] := Times @@ f @@@ FactorInteger[n]; a[1] = 1; Array[a, 100]

a(n) = {my(f = factor(n)); prod(i = 1, #f~, 1 + if(f[i,2]%2,  f[i,1]^f[i,2], 0));}

a(n) >= 1 with equality if and only if n is a square (A000290).
a(n) <= A033634(n) with equality if and only if n is squarefree (A005117).
Multiplicative with a(p^e) = p^e + 1 if e is odd, and 1 otherwise.
a(n) = A034448(n)/A358347(n).
Sum_{k=1..n} a(k) ~ n^2/2.
From Amiram Eldar, Sep 14 2023: (Start)
a(n) = A034448(A350389(n)).
Dirichlet g.f.: zeta(s) * zeta(2*s-2) * Product_{p prime} (1 + 1/p^(s-1) - 1/p^(2*s-2) - 1/p^(2*s-1)). (End)

A351571 Arithmetic derivative of the sum of the divisors of the largest unitary divisor of n that is an exponentially odd number.

Original entry on oeis.org

0, 1, 4, 0, 5, 16, 12, 8, 0, 21, 16, 4, 9, 44, 44, 0, 21, 1, 24, 5, 80, 60, 44, 92, 0, 41, 68, 12, 31, 156, 80, 51, 112, 81, 112, 0, 21, 92, 92, 123, 41, 272, 48, 16, 5, 156, 112, 4, 0, 1, 156, 9, 81, 244, 156, 244, 176, 123, 92, 44, 33, 272, 12, 0, 124, 384, 72, 21, 272, 384, 156, 8, 39, 101, 4, 24, 272, 332, 176, 5

Offset: 1

Antti Karttunen, Feb 23 2022

Antti Karttunen, Table of n, a(n) for n = 1..20000
Index entries for sequences related to sigma(n)

Cf. A000203, A003415, A268335 (exponentially odd numbers), A342925, A350389, A351569, A351570, A351573.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A350389(n) = { my(m=1, f=factor(n)); for(k=1,#f~,if(1==(f[k,2]%2), m *= (f[k,1]^f[k,2]))); (m); };
A351571(n) = A003415(sigma(A350389(n)));

a(n) = A003415(A351569(n)) = A342925(A350389(n)) = A003415(A000203(A350389(n))).

A365402 The number of divisors of the largest unitary divisor of n that is an exponentially odd number.

Original entry on oeis.org

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

Offset: 1

Amiram Eldar, Sep 03 2023

The sum of these divisors is A351569(n).

All the terms are either 1 or even (A004277).

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

Cf. A000005, A000290, A004277, A268335, A350389, A351569, A365401.

f[p_, e_] := If[OddQ[e], e + 1, 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

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

from math import prod
from sympy import factorint
def A365402(n): return prod(e+1 for e in factorint(n).values() if e&1) # Chai Wah Wu, Nov 17 2023

def a(n): return prod((valuation(n,p)+1) for p in prime_divisors(n) if valuation(n,p)%2==1) # Orges Leka, Nov 16 2023

a(n) = A000005(A350389(n)).
a(n) = A000005(n) / A365401(n).
a(n) <= A000005(n) with equality if and only if n is an exponentially odd number (A268335).
a(n) >= 1 with equality if and only if n is a square (A000290).
Multiplicative with a(p^e) = 1 if e is even, and e+1 if e is odd.
Dirichlet g.f.: zeta(2*s)^2 * Product_{p prime} (1 + 2/p^s - 1/p^(2*s)).
From Vaclav Kotesovec, Sep 05 2023: (Start)
Dirichlet g.f.: zeta(s)^2 * zeta(2*s)^2 * Product_{p prime} (1 - 4/p^(2*s) + 4/p^(3*s) - 1/p^(4*s)).
Let f(s) = Product_{p prime} (1 - 4/p^(2*s) + 4/p^(3*s) - 1/p^(4*s)).
Sum_{k=1..n} a(k) ~ f(1) * Pi^4 * n / 36 * (log(n) + 2*gamma - 1 + 24*Zeta'(2)/Pi^2 + f'(1)/f(1)), where
f(1) = Product_{p prime} (1 - 4/p^2 + 4/p^3 - 1/p^4) = 0.2177787166195363783230075141194468131307977550013559376482764035236264911...
f'(1) = f(1) * Sum_{p prime} 4*(2*p - 1) * log(p) / (1 - 3*p + p^2 + p^3) = f(1) * 3.3720882314412399056794495057358594564001229865925330149186567502684770675...
and gamma is the Euler-Mascheroni constant A001620. (End)
a(n) = Sum_{d|n} (-1)^(Sum_{p|gcd(d,n/d)} v_p(d)*v_p(n/d)), where v_p(x) denotes the valuation of x at the prime p. - Orges Leka, Nov 16 2023

A367171 The sum of divisors of the largest unitary divisor of n that is a term of A138302.

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 1, 13, 18, 12, 28, 14, 24, 24, 31, 18, 39, 20, 42, 32, 36, 24, 4, 31, 42, 1, 56, 30, 72, 32, 1, 48, 54, 48, 91, 38, 60, 56, 6, 42, 96, 44, 84, 78, 72, 48, 124, 57, 93, 72, 98, 54, 3, 72, 8, 80, 90, 60, 168, 62, 96, 104, 1, 84, 144, 68, 126

Offset: 1

Amiram Eldar, Nov 07 2023

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

Cf. A000203, A048298, A138302, A306633, A367168, A367169, A367170.

Similar sequences: A351568, A351569.

f[p_, e_] := If[e == 2^IntegerExponent[e, 2], (p^(e+1)-1)/(p-1), 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i, 2] == 1 << valuation(f[i, 2], 2), (f[i, 1]^(f[i, 2]+1)-1)/(f[i, 1]-1), 1));}

Multiplicative with a(p^e) = (p^(A048298(e)+1)-1)/(p-1).
a(n) = A000203(A367168(n)).
a(n) <= A000203(n), with equality if and only if n is in A138302.
Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = zeta(2)/zeta(3) = 1.368432... (A306633).

A377990 a(n) = sigma(sigma(A350388(n))) * sigma(sigma(A350389(n))), where A350388 and A350389 are the largest unitary divisor of n that is a square, and the largest unitary divisor of n that is an exponentially odd number, respectively.

Original entry on oeis.org

1, 4, 7, 8, 12, 28, 15, 24, 14, 39, 28, 56, 24, 60, 60, 32, 39, 56, 42, 96, 63, 91, 60, 168, 32, 96, 90, 120, 72, 195, 63, 104, 124, 120, 124, 112, 60, 168, 120, 234, 96, 252, 84, 224, 168, 195, 124, 224, 80, 128, 195, 192, 120, 360, 195, 360, 186, 234, 168, 480, 96, 252, 210, 128, 224, 403, 126, 312, 252, 403, 195

Offset: 1

Antti Karttunen, Nov 15 2024

nonn

Differs from A051027 at 52, 98, 156, 164, 245, ..., = A377991.

Antti Karttunen, Table of n, a(n) for n = 1..20000
Index entries for sequences related to sigma(n)

Cf. A000203, A051027, A350388, A350389, A351568, A351569, A377991.

A350388(n) = { my(m=1, f=factor(n)); for(k=1,#f~,if(0==(f[k,2]%2), m *= (f[k,1]^f[k,2]))); (m); };
A350389(n) = { my(m=1, f=factor(n)); for(k=1,#f~,if(1==(f[k,2]%2), m *= (f[k,1]^f[k,2]))); (m); };
A377990(n) = (sigma(sigma(A350388(n))) * sigma(sigma(A350389(n))));

a(n) = A051027(A350388(n)) * A051027(A350389(n)).

a(n) = sigma(A351568(n)) * sigma(A351569(n)).

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

Amiram Eldar, Jan 14 2025

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

Cf. A000010, A000290, A013662, A077591, A268335, A350389, A351569, A365402, A374456, A380164.

f[p_, e_] := If[OddQ[e], (p-1)*p^(e-1), 1]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

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));}

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... .

cp's OEIS Frontend

A377991 Numbers k such that A351568(k) and A351569(k) are not coprime, where A351568 and A351569 are the sum of divisors of the largest unitary divisor of n that is a square, and of the largest unitary divisor of n that is an exponentially odd number, respectively.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

PARI

Formula

A374485 Lexicographically earliest infinite sequence such that a(i) = a(j) => A350388(i) = A350388(j) and A351569(i) = A351569(j), for all i, j >= 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A342925 a(n) = A003415(sigma(n)), where A003415 is the arithmetic derivative, and sigma is the sum of divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A351568 Sum of the divisors of the largest unitary divisor of n that is a square.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A358346 a(n) is the sum of the unitary divisors of n that are exponentially odd (A268335).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A351571 Arithmetic derivative of the sum of the divisors of the largest unitary divisor of n that is an exponentially odd number.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A365402 The number of divisors of the largest unitary divisor of n that is an exponentially odd number.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

SageMath

Formula

A367171 The sum of divisors of the largest unitary divisor of n that is a term of A138302.

Views

Author

Keywords

Links