Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053728
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 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: A114273 A074336 A086475 this_sequence A059055 A004061 A000572

Adjacent sequences: A053725 A053726 A053727 this_sequence A053729 A053730 A053731

KEYWORD

easy,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Feb 20 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research