|
Search: id:A023194
|
|
|
| A023194 |
|
Numbers n such that sigma(n) (sum of divisors of n) is prime. |
|
+0 14
|
|
| 2, 4, 9, 16, 25, 64, 289, 729, 1681, 2401, 3481, 4096, 5041, 7921, 10201, 15625, 17161, 27889, 28561, 29929, 65536, 83521, 85849, 146689, 262144, 279841, 458329, 491401, 531441, 552049, 579121, 597529, 683929, 703921, 707281, 734449, 829921, 1190281
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
All numbers except the first are squares. Why? - Zak Seidov (zakseidov(AT)yahoo.com), Jun 10 2005
Answer from Gabe Cunningham (gcasey(AT)MIT.EDU): "From the fact that the sigma (the sum-of-divisors function) is multiplicative, we can derive that the sigma(n) is even except when n is a square or twice a square.
"If n = 2(2k+1)^2, that is, n is twice an odd square, then sigma(n) = 3*sigma((2k+1)^2). If n = 2(2k)^2, that is, n is twice an even square, then sigma(n) is only prime if n is a power of 2; otherwise we have sigma(n) = sigma(8*2^m) * sigma(k/2^m) for some positive integer m.
"So the only possible candidates for values of n other than squares such that sigma(n) is prime are odd powers of 2. But sigma(2^(2m+1)) = 2^(2m+2)-1 = (2^(m+1)+1) * (2^(m+1) - 1), which is only prime when m=0, that is, when n=2. So 2 is the only non-square n such that sigma(n) is prime."
All numbers on this list also have a prime number of divisors. [From Howard Berman (howard_berman(AT)hotmail.com), Oct 29 2008]
|
|
LINKS
|
David W. Wilson, Table of n, a(n) for n = 1..10000
|
|
MATHEMATICA
|
Select[ Range[ 100000 ], PrimeQ[ DivisorSigma[ 1, # ] ]& ]
|
|
PROGRAM
|
(PARI) for(x=1, 1000, if(isprime(sigma(x)), print(x))) (Jorge Coveiro (jorgecoveiro(AT)yahoo.com), Dec 23 2004)
|
|
CROSSREFS
|
Cf. A055638.
Cf. A107926.
Sequence in context: A006474 A110878 A077137 this_sequence A114080 A090676 A000291
Adjacent sequences: A023191 A023192 A023193 this_sequence A023195 A023196 A023197
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|