|
Search: id:A053728
|
|
|
| A053728 |
|
For n=1,2,3,..., compute sum of aliquot divisors of n; if result is prime append this prime to sequence. |
|
+0
1
|
|
| 3, 7, 11, 13, 31, 13, 17, 43, 17, 23, 41, 19, 19, 23, 73, 41, 29, 31, 127, 47, 37, 31, 89, 73, 43, 29, 131, 71, 37, 47, 31, 31, 53, 83, 157, 97, 59, 97, 137, 101, 37, 67, 107, 41, 37, 523, 109, 113, 73, 211, 43, 79, 61, 43, 131, 191, 41, 463, 241, 67, 89, 43, 53, 103, 167
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(4)=13 because when n=27, divisors are 1, 3, 9, which sum to 13, prime
|
|
CROSSREFS
|
Sequence in context: A086475 A154832 A164568 this_sequence A059055 A145670 A004061
Adjacent sequences: A053725 A053726 A053727 this_sequence A053729 A053730 A053731
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Feb 20 2000
|
|
EXTENSIONS
|
Missing term a(9)=17 is added by Zak Seidov (zakseidov(AT)yahoo.com), Sep 11 2009
|
|
|
Search completed in 0.002 seconds
|
