login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073927 Smallest n-th power >1 such that every partial sum is a prime. 0
2, 9, 8, 160000, 7962624, 191102976, 34359738368, 256, 692533995824480256, 604661760000000000, 743008370688, 149587343098087735296, 2316779994178213904384, 268435456, 30517578125000000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

MAPLE

a[1] := 2:for n from 2 to 50 do i := 2:iss := false:while(iss=false) do iss := true: if isprime(sum(a[j], j=1..n-1)+i^n)=false then iss := false:fi:i := i+1:od:i := i-1: a[n] := i^n:od:seq(a[l], l=1..50);

CROSSREFS

Sequence in context: A073904 A036879 A281389 * A198358 A145427 A104954

Adjacent sequences:  A073924 A073925 A073926 * A073928 A073929 A073930

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Aug 19 2002

EXTENSIONS

More terms from Vladeta Jovovic and Sascha Kurz, Aug 19 2002

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 January 17 15:12 EST 2020. Contains 330958 sequences. (Running on oeis4.)