A345048 -id:A345048 - cp's OEIS frontend

A345051 Numbers k such that A345048(k) is equal to A345049(k).

2, 6, 9, 15, 28, 496, 625, 1225, 3993, 8128, 117649, 218491, 857375, 3788435, 4259571, 33550336, 69302975, 136410197, 200533921, 313742585, 603439225, 1516358753, 2563893625, 3326174929, 5655792025, 8589869056, 10214476341

Offset: 1

Antti Karttunen, Jun 06 2021

Numbers k for which A342001(n) * A051709(n) = A173557(n) * A345001(n).

Conjecture: Sequence is a disjoint union of A000396 and A166374, i.e., there are no terms of any other kind.

Index entries for sequences where odd perfect numbers must occur, if they exist at all.

Cf. A051709, A173557, A342001, A345001, A345048, A345049.
Positions of zeros in A345050.
Cf. A000396, A166374 (subsequences).
Cf. also A345003.

PARI
```
isA345051(n) = (0==A345050(n));
```

a(21)-a(27) from Amiram Eldar, Dec 08 2023

A345050 a(n) = A345048(n) - A345049(n).

Original entry on oeis.org

1, 0, 2, -1, 12, 0, 30, -2, 0, -6, 90, 24, 132, -12, 0, -3, 240, 15, 306, 16, 20, -24, 462, 108, 38, -30, -14, 0, 756, 276, 870, -4, 108, -42, 264, 152, 1260, -48, 176, 130, 1560, 348, 1722, -56, -60, -60, 2070, 336, 164, -35, 360, -96, 2652, 84, 912, 136, 476, -78, 3306, 1824, 3540, -84, -110, -5, 1380, 492, 4290

Offset: 1

Antti Karttunen, Jun 06 2021

sign

Cf. A345048, A345049, A345051 (positions of zeros).

PARI
```
A345050(n) = (A345048(n) - A345049(n));
```

a(n) = A345048(n) - A345049(n).

A051709 a(n) = sigma(n) + phi(n) - 2n.

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 3, 1, 2, 0, 8, 0, 2, 2, 7, 0, 9, 0, 10, 2, 2, 0, 20, 1, 2, 4, 12, 0, 20, 0, 15, 2, 2, 2, 31, 0, 2, 2, 26, 0, 24, 0, 16, 12, 2, 0, 44, 1, 13, 2, 18, 0, 30, 2, 32, 2, 2, 0, 64, 0, 2, 14, 31, 2, 32, 0, 22, 2, 28, 0, 75, 0, 2, 14, 24, 2, 36, 0

Offset: 1

Jud McCranie and Carlos Rivera

nonn

Sigma is the sum of divisors (A000203), and phi is the Euler totient function (A000010). - Michael B. Porter, Jul 05 2013
Because sigma and phi are multiplicative functions, it is easy to show that (1) if a(n)=0, then n is prime or 1 and (2) if a(n)=2, then n is the product of two distinct prime numbers. Note that a(n) is the n-th term of the Dirichlet series whose generating function is given below. Using the generating function, it is theoretically possible to compute a(n). Hence a(n)=0 could be used as a primality test and a(n)=2 could be used as a test for membership in P2 (A006881). - T. D. Noe, Aug 01 2002
It appears that a(n) - A002033(n) = zeta(s-1) * (zeta(s) - 2 + 1/zeta(s)) + 1/(zeta(s)-2). - Eric Desbiaux, Jul 04 2013
a(n) = 1 if and only if n = prime(k)^2 (n is in A001248). It seems that a(n) = k has only finitely many solutions for k >= 3. - Jianing Song, Jun 27 2021

			a(5) = sigma(5) + phi(5) - 2*5 = 6 + 4 - 10 = 0.

Antti Karttunen, Table of n, a(n) for n = 1..65537 (First 1000 terms from T. D. Noe.)
Carlos Rivera, Puzzle 76. z(n)=sigma(n) + phi(n) - 2n, The Prime Puzzles and Problems Connection.

Cf. A000010, A000203, A001065, A001248, A005843, A006881, A051612, A051953, A065387, A072780, A228498 (= a(n^2)), A297159, A324048, A344994, A344995, A344996, A345048, A345054.
Cf. A278373 (range of this sequence), A056996 (numbers not present).
Cf. also A344753, A345001 (analogous sequences).

Table[DivisorSigma[1,n]+EulerPhi[n]-2n,{n,80}] (* Harvey P. Dale, Apr 08 2015 *)

a(n)=sigma(n)+eulerphi(n)-2*n \\ Charles R Greathouse IV, Jul 05 2013

A051709(n) = -sumdiv(n,d,(dAntti Karttunen, Mar 02 2018

Dirichlet g.f.: zeta(s-1) * (zeta(s) - 2 + 1/zeta(s)). - T. D. Noe, Aug 01 2002
From Antti Karttunen, Mar 02 2018: (Start)
a(n) = A001065(n) - A051953(n).  [Difference between the sum of proper divisors of n and their Moebius-transform.]
a(n) = -Sum_{d|n, dA008683(n/d)*A001065(d). (End)
Sum_{k=1..n} a(k) = (3/(Pi^2) + Pi^2/12 - 1) * n^2 + O(n*log(n)). - Amiram Eldar, Dec 03 2023

A345049 a(n) = A173557(n) * A345001(n).

Original entry on oeis.org

-1, 0, -2, 3, -12, 10, -30, 11, 2, 20, -90, 40, -132, 30, 16, 31, -240, 48, -306, 104, 0, 50, -462, 112, -36, 60, 26, 192, -756, 344, -870, 79, -80, 80, -240, 158, -1260, 90, -144, 312, -1560, 636, -1722, 440, 216, 110, -2070, 280, -162, 152, -320, 600, -2652, 186, -880, 600, -432, 140, -3306, 1120, -3540, 150, 348, 191

Offset: 1

Antti Karttunen, Jun 06 2021

sign

Cf. A173557, A345001, A345048, A345050, A345051.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A173557(n) = factorback(apply(p -> p-1,factor(n)[,1]));
A345001(n) = (sigma(n)+A003415(n)-(2*n));
A345049(n) = (A173557(n) * A345001(n));

a(n) = A173557(n) * A345001(n).

a(n) = A345048(n) - A345050(n).

cp's OEIS Frontend

A345051 Numbers k such that A345048(k) is equal to A345049(k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Extensions

A345050 a(n) = A345048(n) - A345049(n).

Views

Author

Keywords

Crossrefs

Programs

PARI

Formula

A051709 a(n) = sigma(n) + phi(n) - 2n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A345049 a(n) = A173557(n) * A345001(n).

Views

Author

Keywords

Crossrefs

Programs

PARI

Formula