|
%I #14 Aug 22 2022 20:00:17
%S 1,3,7,15,19,27,31,43,51,55,63,71,75,83,95,99,103,111,115,139,159,167,
%T 179,183,199,223,231,235,243,259,267,271,283,303,311,315,319,343,351,
%U 355,363,371,375,383,395,399,403,415,423,439,447,451,463,471,487,495
%N a(1)=1, then "jump over next prime": a(n) = 2 nextprime(a(n-1))-a(n-1).
%C The rule "jump over next something" can be varied. In A074487 the example "jump over next square" is given.
%H Robert Israel, <a href="/A075694/b075694.txt">Table of n, a(n) for n = 1..10000</a>
%F a(1)=1, a(n) = 2 nextprime(a(n-1))-a(n-1).
%e a(1)=1; next prime (smallest larger than a(1))=2; "jump over" it: 2+(2-1)=3; a(2)=3; next prime (smallest larger than a(2))=5; "jump over" it: 5+(5-3)=7; a(7)=31; next prime (smallest larger than a(7))=37; "jump over" it: 37+(37-31)=43.
%p A:= Vector(100):
%p A[1]:= 1:
%p for n from 2 to 100 do A[n]:= 2*nextprime(A[n-1])-A[n-1] od:
%p convert(A,list); # _Robert Israel_, Dec 01 2020
%t NestList[2*NextPrime[#]-#&,1,60] (* _Harvey P. Dale_, Aug 22 2022 *)
%Y Cf. A075695.
%K easy,nonn
%O 1,2
%A _Zak Seidov_, Sep 26 2002
|
