A077101 -id:A077101 - cp's OEIS frontend

A077100 a(n) = lcm(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).

0, 4, 6, 45, 10, 70, 14, 209, 133, 154, 22, 96, 26, 90, 32, 897, 34, 495, 38, 850, 220, 598, 46, 884, 561, 270, 638, 748, 58, 320, 62, 3713, 476, 1330, 72, 8137, 74, 546, 160, 3922, 82, 756, 86, 832, 918, 2350, 94, 3780, 495, 8249, 520, 4514, 106, 2346, 224

Offset: 1

Labos Elemer, Nov 06 2002

nonn

Michael De Vlieger, Table of n, a(n) for n = 1..10000

Cf. A000010, A000203, A051612, A065387, A077099, A077101.

Table[LCM[#1 - #2, #1 + #2] & @@ {DivisorSigma[1, n], EulerPhi@ n}, {n, 55}] (* Michael De Vlieger, Dec 17 2016 *)

a(n)=my(f=factor(n),e=eulerphi(f),s=sigma(f)); lcm(s+e,s-e) \\ Charles R Greathouse IV, Nov 27 2013

If p is prime, then a(p) = 2*p.

Edited by Dean Hickerson, Nov 07 2002

A077102 Smallest number m such that GCD(a+b,a-b) = n, where a = sigma(m) and b = phi(m).

Original entry on oeis.org

4, 1, 18, 21, 200, 14, 3364, 12, 722, 328, 9801, 42, 25281, 116, 1800, 15, 36992, 810, 4414201, 88, 196, 29161, 541696, 35, 2928200, 1413, 103968, 284, 98942809, 488, 1547536, 364, 19602, 17536, 814088, 370, 49042009, 55297, 1521, 440, 3150464641

Offset: 1

Labos Elemer, Nov 12 2002

nonn

			For n = 10, a(10) = 328, sigma(328) = 630, phi(328) = 160, sigma(328) + phi(328) = 790, sigma(328) - phi(328) = 470, GCD(790,470) = 10.
For n = odd number, a(n) should be either a square or twice a square and so faster search for large values is possible, like e.g., for n = 97: a(97) = 435979^2 is the smallest solution.

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

Cf. A000010, A000203, A051612, A065387, A077099, A077100, A077101.

f[x_] := Apply[GCD, {DivisorSigma[1, x]+EulerPhi[x], DivisorSigma[1, x]-EulerPhi[x]}]; t=Table[0, {100}]; Do[s=f[n]; If[s<101&&t[[s]]==0, t[[s]]=n], {n, 1, 10^13}]; t

lista(len) = {my(v = vector(len), c = 0, k = 1, a, b, i); while(c < len, f = factor(k); a = sigma(f); b = eulerphi(f); i = gcd(a+b,a-b); if(i <= len && v[i] == 0, c++; v[i] = k); k++); v;} \\ Amiram Eldar, Nov 14 2024

a(n) = Min{x; A077099(x) = n}.

cp's OEIS Frontend

A077100 a(n) = lcm(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions