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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A233132 Prime(n), where n is such that (sum_{i=1..n} prime(i)^10) / n is an integer. 0
2, 1723, 504017, 707602177, 3221410523, 50872396681, 502768196591, 809590307027 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(9) > 1093881323023.

LINKS

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

OEIS Wiki, Sums of powers of primes divisibility sequences

FORMULA

a(n) = prime(A131264(n))

EXAMPLE

a(2) = 1723, because 1723 is the 269th prime and the sum of the first 269 primes^10 = 5093580907935902678630090684087692 when divided by 269 equals 18935245010914136351784723732668 which is an integer.

MATHEMATICA

t = {}; sm = 0; Do[sm = sm + Prime[n]^10; If[Mod[sm, n] == 0, AppendTo[t, Prime[n]]], {n, 100000}]; t (* Derived from A217599 *)

PROG

(PARI) is(n)=if(!isprime(n), return(0)); my(t=primepi(n), s); forprime(p=2, n, s+=Mod(p, t)^10); s==0 \\ Charles R Greathouse IV, Nov 30 2013

(PARI) S=n=0; forprime(p=1, , (S+=p^10)%n++||print1(p", ")) \\ - M. F. Hasler, Dec 01 2013

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: A179961 A160224 A129061 * A277389 A011541 A080642

Adjacent sequences:  A233129 A233130 A233131 * A233133 A233134 A233135

KEYWORD

nonn,more

AUTHOR

Robert Price, Dec 04 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 September 21 07:08 EDT 2019. Contains 327253 sequences. (Running on oeis4.)