The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A249567 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A249567

a(1)=1; thereafter a(n) = smallest square m^2 such that m^2 minus (sum of all previous terms) is prime.
(history; published version)

#14 by N. J. A. Sloane at Mon Nov 14 17:36:49 EST 2016

STATUS

proposed

approved

#13 by Robert Israel at Mon Nov 14 17:31:20 EST 2016

STATUS

editing

proposed

#12 by Robert Israel at Mon Nov 14 17:31:03 EST 2016

LINKS

Robert Israel, <a href="/A249567/b249567.txt">Table of n, a(n) for n = 1..3310</a>

#11 by Robert Israel at Mon Nov 14 17:12:51 EST 2016

MAPLE

A[1]:= 1: S:= 1:

for n from 2 to 100 do

m0:= ceil(sqrt(2+S));

if m0::odd then m0:= m0+1 fi;

for m from m0 by 2 do

if isprime(m^2 - S) then

A[n]:= m^2;

S:= S + A[n];

break

fi

od

od:

seq(A[i], i=1..100); # Robert Israel, Nov 14 2016

STATUS

approved

editing

#10 by N. J. A. Sloane at Wed Nov 19 00:25:35 EST 2014

STATUS

proposed

approved

#9 by Ivan N. Ianakiev at Tue Nov 18 05:13:33 EST 2014

STATUS

editing

proposed

#8 by Alonso del Arte at Mon Nov 03 11:55:46 EST 2014

MATHEMATICA

lstA249567 = {1}; n = 2; While[n < 10^5, If[n^2 - Total[lstA249567] > 0 && PrimeQ[n^2 - Total[lstA249567]], AppendTo[lst, A249567, n^2]]; n++]; A249567 (* _Ivan N. Ianakiev_, Nov 03 2014 *)

lst (* Ivan N. Ianakiev, Nov 03 2014 *)

STATUS

proposed

editing

Discussion

Tue Nov 18

05:00

OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A249567 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server

#7 by Ivan N. Ianakiev at Mon Nov 03 02:30:51 EST 2014

STATUS

editing

proposed

#6 by Ivan N. Ianakiev at Mon Nov 03 02:29:25 EST 2014

MATHEMATICA

lst={1}; n=2; While[n<10^5, If[n^2-Total[lst]>0&&PrimeQ[n^2-Total[lst]], AppendTo[lst, n^2]]; n++];

lst (* Ivan N. Ianakiev, Nov 03 2014 *)

STATUS

approved

editing

#5 by N. J. A. Sloane at Sat Nov 01 20:50:02 EDT 2014

STATUS

editing

approved