login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125571 Least prime factor of Sum_{k=0..n-1} n^k. 1
3, 13, 5, 11, 7, 29, 3, 7, 11, 15797, 5, 53, 3, 11, 17, 10949, 7, 109912203092239643840221, 3, 43, 23, 461, 5, 11, 3, 109, 5, 59, 7, 568972471024107865287021434301977158534824481, 3, 67, 5, 31, 13, 149, 3, 7, 11, 83, 13, 173, 3, 19, 47 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

COMMENTS

The sequence of largest prime factors of numbers generated by the same sum is probably identical to sequence A006486, since (n^n - 1)/(1 + n^2 + ... + n^(n-1)) = n-1.

LINKS

Chai Wah Wu, Table of n, a(n) for n = 2..178

EXAMPLE

The sum 1 + 4 + 4^2 + 4^3 = 85 = 5 * 17 so the third term is 5.

PROG

(PARI) a(n) = factor(sum(k=0, n-1, n^k))[1, 1]; \\ Michel Marcus, Aug 20 2013

CROSSREFS

Cf. A006486.

Least prime factors of A023037.

Sequence in context: A128368 A050089 A282174 * A187023 A331806 A331807

Adjacent sequences:  A125568 A125569 A125570 * A125572 A125573 A125574

KEYWORD

nonn

AUTHOR

Axel Harvey, Jan 02 2007

EXTENSIONS

More terms from Michel Marcus, Aug 20 2013

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 3 08:56 EST 2021. Contains 349445 sequences. (Running on oeis4.)