[go: up one dir, main page]

login
Let a(1)=1; for n>1 a(n)=nextprime(a(n-1)+(a(n-1)+1)/4).
1

%I #6 Dec 30 2012 01:45:22

%S 1,2,3,5,7,11,17,23,29,37,47,59,79,101,127,163,211,269,337,431,541,

%T 677,853,1069,1361,1709,2137,2677,3347,4201,5261,6577,8231,10289,

%U 12889,16127,20161,25219,31531,39419,49277,61603,77017,96281,120371,150473

%N Let a(1)=1; for n>1 a(n)=nextprime(a(n-1)+(a(n-1)+1)/4).

%C The following definition of nextprime(q) is used: if q is integer and prime, nextprime(q)=q. If q is integer and composite or rational, nextprime(q) is the smallest prime >q. [From _R. J. Mathar_, Oct 30 2010]

%p Contribution from _R. J. Mathar_, Oct 30 2010: (Start)

%p nprime := proc(n) if type(n,'integer') then if isprime(n) then return n; else return nextprime(n) ; end if; else return nextprime(floor(n)) ; end if; end proc:

%p A175953 := proc(n) option remember; if n= 1 then 1; else p := procname(n-1)+(procname(n-1)+1)/4 ; return nprime(p) ; end if; end proc:

%p seq(A175953(n),n=1..120) ; (End)

%Y Cf. A008578, A055496, A089571, A162336.

%K nonn,easy

%O 1,2

%A _Juri-Stepan Gerasimov_, Oct 29 2010

%E More terms from _R. J. Mathar_, Oct 30 2010