The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A093355

(Bold, blue-underlined text is an ; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A093355

Beginning with 2, primes such that the n-th partial sum is an n-th power.
(history; published version)

#10 by Alois P. Heinz at Sun Jun 10 20:37:10 EDT 2018

STATUS

proposed

#9 by Jon E. Schoenfield at Sun Jun 10 15:00:15 EDT 2018

STATUS

editing

#8 by Jon E. Schoenfield at Sun Jun 10 15:00:11 EDT 2018

COMMENTS

Requiring a(n+1)>a(n) leads to the finite sequence A073860. Not allowing repetition leads to A073698. [From _M. F. Hasler_, Apr 07 2009]

PROG

(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]

CROSSREFS

Cf. A073698, A073860. [From _M. F. Hasler_, Apr 07 2009]

STATUS

approved

#7 by N. J. A. Sloane at Thu Dec 05 19:56:46 EST 2013

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 25 2004

Discussion

Thu Dec 05

19:56

OEIS Server: https://oeis.org/edit/global/2075

#6 by Charles R Greathouse IV at Sat Jul 14 11:32:16 EDT 2012

COMMENTS

Requiring a(n+1)>a(n) leads to the finite sequence A073860. Not allowing repetition leads to A073698. [From M. F. Hasler (www.univ-ag.fr/~mhasler), Apr 07 2009]

PROG

(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]

CROSSREFS

Cf. A073698, A073860. [From M. F. Hasler (www.univ-ag.fr/~mhasler), Apr 07 2009]

Discussion

Sat Jul 14

11:32

OEIS Server: https://oeis.org/edit/global/1815

#5 by Russ Cox at Sat Mar 31 14:11:24 EDT 2012

EXTENSIONS

More terms from Ray G. Opao (1260(AT)email.com), Nov 29 2004

Discussion

Sat Mar 31

14:11

OEIS Server: https://oeis.org/edit/global/930

#4 by N. J. A. Sloane at Sun Jul 11 03:00:00 EDT 2010

COMMENTS

Requiring a(n+1)>a(n) leads to the finite sequence A073860. Not allowing repetition leads to A073698. [From M. F. Hasler (MHasler(AT)univ-ag.fr), Apr 07 2009]

PROG

(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]

CROSSREFS

Cf. A073698, A073860. [From M. F. Hasler (MHasler(AT)univ-ag.fr), Apr 07 2009]

KEYWORD

nonn,new

#3 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010

COMMENTS

PROG

CROSSREFS

KEYWORD

nonn,new

#2 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005

NAME

Beginning with 2 primes such that the n-th partial sum is an n-th power.

DATA

2, 2, 23, 229

KEYWORD

more,nonn,uned,new

EXTENSIONS

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

#1 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004

NAME

DATA

OFFSET

EXAMPLE

CROSSREFS

KEYWORD

AUTHOR

EXTENSIONS

STATUS