proposed
proposed
editing
(PARI) s=0; for( n=1, 999, t=floor(sqrtn(s, n)); until( isprime( t++^n-s), ); print1( t^n-s, ", "); s=t^n) [From _M. F. Hasler_, Apr 07 2009]
approved
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 25 2004
(PARI) s=0; for( n=1, 999, t=floor(sqrtn(s, n)); until( isprime( t++^n-s), ); print1( t^n-s, ", "); s=t^n) [From M. F. Hasler (www.univ-ag.fr/~mhasler), Apr 07 2009]
More terms from Ray G. Opao (1260(AT)email.com), Nov 29 2004
(PARI) s=0; for( n=1, 999, t=floor(sqrtn(s, n)); until( isprime( t++^n-s), ); print1( t^n-s, ", "); s=t^n) [From M. F. Hasler (MHasler(AT)univ-ag.fr), Apr 07 2009]
nonn,new
nonn,new
Beginning with 2 primes such that the n-th partial sum is an n-th power.
2, 2, 23, 229
more,nonn,uned,new
Warning: Many recent communications from this author have contained numerical errors or have been badly formatted. This entry has not been edited and may contain errors. It is included on a provisional basis in the hope that some reader will edit it. - njas