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!)
A330308 Smallest prime p such that the sum of cubes of all primes up to p is a multiple of 10^n. 2
5, 233, 8783, 24763, 5828099, 9229931, 262707241, 7717488553, 34529828929, 311995561321, 549120448879, 33777547344991 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Suggested in a discussion in Mersenneforum, with contributions by users "davar55", Charles R Greathouse IV, and Benjamin R. Buhrow. The latter calculated terms a(1)-a(12) of this sequence (see links).
LINKS
Ben Buhrow, Software and extended tables, 07 Apr 2010.
Ben Buhrow and others, Sums of Squares, thread in Mersenneforum, April 2010.
EXAMPLE
a(1): 10 divides prime cube sum up to 5, sum = 2^3 + 3^3 + 5^3 = 160;
a(2): 100 divides prime cube sum up to 233, sum = 143309500;
a(3): 1000 divides prime cube sum up to 8783, sum = 167992435025000.
PROG
(PARI) for(n=1, 8, my(n10=10^n, s=0); forprime(p=2, oo, s+=p^3; if(!(s%n10), print1(p, ", "); break)))
CROSSREFS
Sequence in context: A176898 A274996 A142668 * A157710 A265957 A137085
KEYWORD
nonn,more,hard
AUTHOR
Hugo Pfoertner, Dec 10 2019
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 June 22 04:04 EDT 2024. Contains 373561 sequences. (Running on oeis4.)