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!)
A233460 Prime(n), where n is such that (sum_{i=1..n} prime(i)^16) / n is an integer. 0
2, 28751, 62639, 4620757, 6478193, 2298168044423, 128195718927553 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(8) > 128971810356197. - Bruce Garner, Mar 24 2021
LINKS
FORMULA
a(n) = prime(A131276(n)).
EXAMPLE
a(1) = 2, because 2 is the 1st prime and the sum of the first 1 primes^16 = 65536 when divided by 1 equals 65536 which is an integer.
MATHEMATICA
t = {}; sm = 0; Do[sm = sm + Prime[n]^16; 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)^16); s==0 \\ Charles R Greathouse IV, Nov 30 2013
(PARI) S=n=0; forprime(p=1, , (S+=p^16)%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).
Sequence in context: A232869 A153912 A247790 * A324164 A047076 A176721
KEYWORD
nonn,more
AUTHOR
Robert Price, Dec 10 2013
EXTENSIONS
a(6)-a(7) from Bruce Garner, Mar 24 2021
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 August 29 16:41 EDT 2024. Contains 375517 sequences. (Running on oeis4.)