login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128169 Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^5 = 1 + A122103(k). 13
1, 2, 4, 6, 10, 12, 22, 58, 155, 363, 464, 665, 1146, 2870, 3048, 4019, 5931, 8724, 21503, 50439, 67560, 476281, 705570, 4050684, 6956459, 7443590, 10449928, 10799546, 15385564, 17735139, 83325458, 245271750, 255583775, 1395860516, 2921734534, 6255577368, 9050771725, 12062893218, 13689205205, 42254229197, 46440930382 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(52) > 3*10^13. - Bruce Garner, Jun 05 2021
a(53) > 1.2*10^14. - Bruce Garner, Mar 28 2022
LINKS
MATHEMATICA
p = 2; k = 0; s = 1; lst = {}; While[k < 521330000, s = s + p^5; If[Mod[s, ++k] == 0, AppendTo[lst, k]; Print[{k, p}]]; p = NextPrime@ p]
CROSSREFS
Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
Sequence in context: A074645 A125286 A045963 * A095923 A094960 A357110
KEYWORD
hard,nonn
AUTHOR
Alexander Adamchuk, Feb 22 2007, Feb 23 2007
EXTENSIONS
a(31) from Sean A. Irvine, Jan 19 2011
a(32)-a(33) from Robert G. Wilson v, Jan 20 2011
a(34)-a(41) from Robert Price, Dec 18 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)