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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128169 Numbers n such that n divides 1 + Sum[ Prime[k]^5, {k,1,n} ] = 1 + A122103(n). 12
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(42) > 7*10^10. - Robert Price, Dec 18 2013

LINKS

Table of n, a(n) for n=1..41.

OEIS Wiki, Sums of powers of primes divisibility sequences

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.

Cf. A007504, A045345, A171399, A128165, A233523, A050247, A050248.

Cf. A024450, A111441, A217599, A128166, A233862, A217600, A217601.

Sequence in context: A074645 A125286 A045963 * A095923 A094960 A100195

Adjacent sequences:  A128166 A128167 A128168 * A128170 A128171 A128172

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 12:01 EDT 2019. Contains 324352 sequences. (Running on oeis4.)