|
Search: id:A159939
|
|
|
| A159939 |
|
Odd solutions of phi ( sigma ( n ) ) = sigma ( phi ( n ) ) |
|
+0
1
|
|
| 9, 225, 729, 18225, 65025, 140625, 531441, 5267025, 11390625, 13286025, 18792225, 40640625, 87890625, 1522170225, 2197265625, 3291890625, 3839661225, 5430953025, 7119140625, 8303765625, 11745140625, 25400390625
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
sigma is the multiplicative sum-of-divisors function.
phi is Euler's totient.
Complete through 25558816403 .
All given here are products of powers of consecutive Fermat primes based on generalized repunit primes; see links.
It is conjectured (see links) that all odd solutions are of this form, for which at least 10130 solutions are known.
|
|
REFERENCES
|
Richard Guy, "Unsolved Problems in Number Theory", section B42
Oystein Ore, "Number Theory and Its History", 1948, reprinted 1988, Dover, ISBN-10: 0486656209, pp. 88 et seq., 109 et seq.
|
|
LINKS
|
Walter Nissen, Home Page (listed in lieu of email address)
Walter Nissen, phi ( sigma ( n ) ) = sigma ( phi ( n ) )
|
|
EXAMPLE
|
sigma(9) = 13, phi(9) = 6, sigma(6) = phi(13) = 12, so 9 is in the sequence.
|
|
CROSSREFS
|
Cf. A000203, A000010, A033632, A019434.
Sequence in context: A057530 A014736 A017558 this_sequence A167038 A074190 A069075
Adjacent sequences: A159936 A159937 A159938 this_sequence A159940 A159941 A159942
|
|
KEYWORD
|
nonn,new
|
|
AUTHOR
|
Walter Nissen Apr 26 2009
|
|
EXTENSIONS
|
Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 28 2009
|
|
|
Search completed in 0.002 seconds
|
