|
Search: id:A011774
|
|
|
| A011774 |
|
Nonprimes n that divide sigma(n) + phi(n). |
|
+0
6
|
|
| 1, 312, 560, 588, 1400, 23760, 59400, 85632, 147492, 153720, 556160, 569328, 1590816, 2013216, 3343776, 4563000, 4695456, 9745728, 12558912, 22013952, 23336172, 30002960, 45326160, 52021242, 75007400, 113315400, 137617728
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
2*n = Sigma(n) + Phi(n) iff n is 1 or a prime.
If 7*2^n-1 is prime then m=2^(n+2)*3*(7*2^n-1) is in the sequence. Because phi(m)=2^(n+2)*(7*2^n-2); sigma(m)=7*2^(n+2)*(2^(n+3)-1) so phi(m)+sigma(m)=2^(n+2)*((7*2^n-2)+(7*2^(n+3)-7))=2^(n+2)* (63*2^(n+2)-9)=3*(2^(n+2)*3*(7*2^n-1))=3*m, hence m is a term of A011251 and consequently m is a term of A011774. A112729 gives such m's. - Farideh Firoozbakht (f.firoozbakht(AT)math.ui.ac.ir), Dec 01 2005
|
|
REFERENCES
|
R. K. Guy, Divisors and desires, Amer. Math. Monthly, 104 (1997), 359-360.
Zhang Ming-Zhi (typescript submitted to Unsolved Problems section of Monthly, 96-01-10)
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
EXAMPLE
|
a(26)=113315400: sigma=426535200 phi=26726400 quotient=4
|
|
MATHEMATICA
|
Do[If[Mod[DivisorSigma[1, n]+EulerPhi[n], n]==0, Print[n]], {n, 1, 2*10^7}]
Do[ If[ ! PrimeQ[n] && Mod[ DivisorSigma[1, n] + EulerPhi[n], n] == 0, Print[n] ], {n, 1, 10^8} ]
|
|
CROSSREFS
|
Cf. A011251, A011254, A055681.
Cf. A001771. A112729.
Sequence in context: A071644 A139638 A112542 this_sequence A011251 A043360 A022044
Adjacent sequences: A011771 A011772 A011773 this_sequence A011775 A011776 A011777
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
R. K. Guy
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net)
Corrected by Labos E. (labos(AT)ana.sote.hu), Feb 12 2004
|
|
|
Search completed in 0.002 seconds
|
