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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175232 The smallest prime divisor of 1 + 2^2 + 3^3 + ... + n^n. 1
5, 2, 2, 3413, 50069, 2, 2, 7, 10405071317, 2, 2, 88799, 3, 2, 2, 3, 3, 2, 2, 5, 3, 2, 2, 3, 7, 2, 2, 7, 208492413443704093346554910065262730566475781, 2, 2, 3, 17, 2, 2, 5, 61, 2, 2, 71, 11, 2, 2, 11, 7, 2, 2, 5, 3, 2, 2, 3, 3, 2, 2, 23, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

Table of n, a(n) for n=2..60.

FORMULA

a(n) = A020639(A001923(n)).

EXAMPLE

a(2) = 5 divides 1 + 2^2.

a(3) = 2 divides 1 + 2^2 + 3^3 = 32.

a(4) = 2 divides 1 + 2^2 + 3^3 + 4^4 = 288.

a(5) = 3413 divides 1 + 2^2 + 3^3 + 4^4 + 5^5 = 3413.

a(13) = 88799 divides 1 + 2^2 + 3^3 + ... + 13^13 = 88799 * 3514531963.

MAPLE

with(numtheory): s :=1: for n from 2 to 60 do ; s := s+ n^n: s1 := ifactors(s)[2] : s2 :=s1[i][1], i=1..nops(s1):print(s1[1][1]):od:

CROSSREFS

Cf. A073826, A122166.

Sequence in context: A199189 A145438 A244290 * A074640 A089261 A111716

Adjacent sequences:  A175229 A175230 A175231 * A175233 A175234 A175235

KEYWORD

nonn

AUTHOR

Michel Lagneau, Mar 09 2010

EXTENSIONS

Edited by R. J. Mathar, Mar 16 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 20:18 EST 2019. Contains 329847 sequences. (Running on oeis4.)