This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097646 Numbers n such that n = phi(phi(n) + sigma(n)). 5
 1, 2, 6, 10, 20, 22, 46, 48, 58, 82, 106, 166, 178, 180, 208, 226, 262, 346, 358, 382, 466, 478, 502, 562, 586, 718, 838, 862, 864, 886, 982, 1018, 1120, 1186, 1282, 1306, 1318, 1366, 1368, 1438, 1486, 1522, 1618, 1822, 1906, 2026, 2038, 2062, 2098, 2206 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS If n=2*p where p is a Sophie Germain odd prime, then n is in the sequence; the proof is obvious. LINKS K. D. Bajpai, Table of n, a(n) for n = 1..10000 C. K. Caldwell, The Prime Glossary, Sophie Germain prime. EXAMPLE 22 is in the sequence because phi(22)=10, sigma(22)=36 and phi(10+36)=22. MAPLE with(numtheory):K:=proc()local n, a, c;  c:=1; for n from 1 to 5000000 do; a:=phi(phi(n)+ sigma(n)); if  a=n  then lprint(c, n); c:=c+1; fi; od; end:K(); # K. D. Bajpai, Jul 18 2013 MATHEMATICA Do[If[n==EulerPhi[EulerPhi[n]+DivisorSigma[1, n]], Print[n]], {n, 2400}] PROG (PARI) is(n)=sigma(n=factor(n))==eulerphi(eulerphi(n)) \\ Charles R Greathouse IV, Nov 27 2013 (MAGMA) [n: n in [1..2300] | n eq EulerPhi(EulerPhi(n) + DivisorSigma(1, n))]; // Vincenzo Librandi, Aug 22 2015 CROSSREFS Cf. A097652, A005384, A097645, A018784. Sequence in context: A209535 A065054 A128165 * A077084 A239542 A007926 Adjacent sequences:  A097643 A097644 A097645 * A097647 A097648 A097649 KEYWORD nonn AUTHOR Farideh Firoozbakht, Sep 08 2004 STATUS approved

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

Last modified October 22 05:29 EDT 2019. Contains 328315 sequences. (Running on oeis4.)