cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A139033 a(1)=1; at n>=2, a(n) = least square > a(n-1) such that sum a(1)+...+a(n) is a prime number.

This page as a plain text file.
%I A139033 #10 Jan 27 2023 19:04:45
%S A139033 1,4,36,576,1296,1764,2304,4356,6084,15876,19044,20736,26244,44100,
%T A139033 69696,76176,82944,86436,112896,152100,176400,213444,248004,254016,
%U A139033 260100,285156,291600,324900,381924,396900,412164,435600,476100,492804,553536,608400,705600
%N A139033 a(1)=1; at n>=2, a(n) = least square > a(n-1) such that sum a(1)+...+a(n) is a prime number.
%H A139033 Zak Seidov, <a href="/A139033/b139033.txt">Table of n, a(n) for n = 1..2000</a>
%F A139033 a(n) = A137326(n)^2.
%t A139033 s={1};su=1;Do[p=su+n^2;If[PrimeQ[p],su=p;AppendTo[s,n^2]],{n,2,120000}];s
%Y A139033 Cf. A137326, A139034 (corresponding primes).
%K A139033 nonn
%O A139033 1,2
%A A139033 _Zak Seidov_, Apr 07 2008
%E A139033 Edited by _Alois P. Heinz_, Jan 27 2023