login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073815 Least number x such that gcd(phi(x), sigma(x)) = n. 6

%I #18 Oct 18 2019 10:24:13

%S 1,3,18,12,200,14,3364,15,722,328,9801,42,25281,116,1800,165,36992,

%T 810,4414201,88,196,29161,541696,35,2928200,1413,103968,172,98942809,

%U 488,1547536,336,19602,17536,814088,370,49042009,55297,1521,319,3150464641

%N Least number x such that gcd(phi(x), sigma(x)) = n.

%C Values are frequently identical to terms of A077102. Since gcd(a,b) and gcd(a+b,a-b) may differ, so may the smallest solutions. A077102(m) and a(m) differ at m = 1, 2, 4, 8, 16, 28, 32, 40, etc.

%H Giovanni Resta, <a href="/A073815/b073815.txt">Table of n, a(n) for n = 1..120</a>

%F a(n) = Min{x; A055008(x)=n}. a(n)=Min{x; gcd(A000203(x), A000010(x))=n}

%F a(n) = Min{x: A023897(x)= n}, smallest balanced number (A020492) for which the quotient equals n.

%t f[x_] := Apply[GCD, {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}];

%o (PARI) a(n)=my(x=n);while(gcd(eulerphi(x),sigma(x))!=n, x++); x \\ _Charles R Greathouse IV_, Dec 09 2013

%Y Cf. A000203, A000010, A055008, A077099-A077102, A051612, A065387, A023897, A020492.

%K nonn

%O 1,2

%A _Labos Elemer_, Nov 12 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)