login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,1
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 A348637
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Aug 19 2002
EXTENSIONS
More terms from Vladeta Jovovic and Sascha Kurz, Aug 19 2002
STATUS
approved