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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128167 Numbers n such that n divides 1 + Sum[ Prime[k]^3, {k,1,n} ] = 1 + A098999(n). 0
1, 2, 4, 5, 6, 10, 12, 14, 55, 82, 87, 935, 973, 1168, 1181, 1457, 5457, 7372, 11250, 17978, 25664, 182717, 472931, 2385026, 3002594, 9249715, 21843515, 37468158, 64403264, 87803374, 140933482, 281907048, 342460116, 1543515106, 1995156064 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(36) > 4*10^10. - Robert Price, Dec 16 2013

LINKS

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

OEIS Wiki, Sums of powers of primes divisibility sequences

MATHEMATICA

k = 0; s = 1; p = 2; lst = {}; While[k < 516862000, s = s + p^3; If[Mod[s, ++k] == 0, AppendTo[lst, k]; Print[{k, p}]]; p = NextPrime@ p]; lst

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: A029513 A061949 A233413 * A162534 A233193 A177911

Adjacent sequences:  A128164 A128165 A128166 * A128168 A128169 A128170

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk, Feb 22 2007, Feb 23 2007

EXTENSIONS

Four more terms from Sean A. Irvine, Jan 19 2011

a(32) & a(33) from Robert G. Wilson v

a(34)-a(35) from Robert Price, Dec 16 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 17:46 EST 2016. Contains 278985 sequences.