login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085379 Greatest prime as sum of distinct divisors of n. 3
3, 3, 7, 5, 11, 7, 13, 13, 17, 11, 23, 13, 23, 23, 31, 17, 37, 19, 41, 31, 23, 23, 59, 31, 41, 37, 53, 29, 71, 31, 61, 47, 53, 47, 89, 37, 59, 53, 89, 41, 89, 43, 83, 73, 71, 47, 113, 7, 83, 71, 97, 53, 113, 71, 113, 79, 89, 59, 167, 61, 31, 103, 127, 83, 139, 67 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

COMMENTS

a(n)<=A070801(n)<=A000203(n): a(A085380(n))=A070801(A085380(n)), a(A085381(n)) < A070801(A085381(n));

a(A023194(n))=A000203(A023194(n))=A062700(n).

LINKS

Eric Weisstein's World of Mathematics, Divisor Function

EXAMPLE

Divisors of n=50 are {1,2,5,10,25,50}, sums of distinct divisors

that are prime: 2, 3=2+1, 5, 7=5+2, 11=10+1, 13=10+2+1, 17=10+5+2,

31=25+5+1, 37=25+10+2, 41=25+10+5+1, 43=25+10+5+2+1, 53=50+2+1, 61=50+10+1,

67=50+10+5+2 and 83=50+25+5+2+1: therefore a(50)=83<89=A070801(50),

A085381(3)=50.

CROSSREFS

Sequence in context: A098688 A129266 A129527 * A070801 A114753 A079316

Adjacent sequences:  A085376 A085377 A085378 * A085380 A085381 A085382

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 26 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 08:58 EST 2012. Contains 205614 sequences.