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.
113 is a member as the next member of A093503 is the next prime 127.
a(7) = 17. So a(8) = the largest prime <= 17 + 7 = 24, which is 23.
PrevPrim[n_] := Block[{k = n - 1}, While[ !PrimeQ[k], k-- ]; k]; a[1] = 1; a[n_] := a[n] = PrevPrim[a[n - 1] + n]; Array[a, 55] (* Robert G. Wilson v *)
a[1]=1;a[n_]:=NextPrime[a[n-1]+n,-1];Table[a[n],{n,55}] (* James C. McMahon, Jun 16 2024 *)
nxt[{n_,a_}]:={n+1,If[PrimeQ[a+n],a+n,NextPrime[a+n,-1]]}; NestList[nxt,{1,1},60][[;;,2]] (* Harvey P. Dale, Dec 15 2024 *)
{print1(a=1,",");for(n=2,55,print1(a=precprime(a+n-1),","))} \\ Klaus Brockhaus, Jan 06 2006
The smallest prime above 1+2 is 5, so a(2)=5. The smallest prime above 5+3 is 11, so a(3)=11.
R:= 1: p:= 1: for n from 2 to 100 do p:= nextprime(p+n); R:= R,p; od: R; # Robert Israel, Nov 20 2023
a[1] = 1; a[n_] := a[n] = NextPrime[a[n - 1] + n]; Array[a, 50] (* Amiram Eldar, Feb 03 2022 *)
lista(nn) = my(list = List(), last = 1); listput(list, last); for (n=2, nn, last = nextprime(last + n +1); listput(list, last);); Vec(list); \\ Michel Marcus, Feb 03 2022
from sympy import nextprime p = 1 for i in range(2,1000): print(p, end=",") p = nextprime(p+i)
Comments